fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int binary(int b[],int s,int key)
  4. {
  5. int l=0,h=s;
  6. while(l<=h)
  7. {
  8. int mid=l+(h-l)/2;
  9. if(b[mid]==key)
  10. return mid;
  11. if(b[mid]>key)
  12. h=mid-1;
  13. else if(key>b[mid])
  14. l=mid+1;
  15. }
  16. return -1;
  17. }
  18. int main() {
  19. // your code goes here
  20. int n;
  21. cin>>n;
  22. int a[n],b[n];
  23. for(int i=0;i<n;i++)cin>>a[i];
  24. for(int i=0;i<n;i++)b[i]=a[i];
  25. sort(&a[0],&a[n]);
  26. int s=a[0];
  27. int st=a[n-1];
  28. int smallest=binary(a,sizeof(a)/sizeof(a[0]),s);
  29. int largest=binary(a,sizeof(a)/sizeof(a[0]),st);
  30. cout<<smallest<<" "<<largest;
  31. return 0;
  32. }
Success #stdin #stdout 0s 3144KB
stdin
4
33 44 11 22
stdout
0 3