搜狗笔试编程。二分
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
double a[1000000];
int main(){
int n;
scanf("%d", &n);
for(int i = 0 ; i < n ; i){
scanf("%lf", &a[i]);
}
double ans = 0;
for(int i = 0 ; i < n ; i){
int bf = 0;
int ef = n;
int mid = (bf ef)/2;
while(bf < ef){
mid = (bf ef)/2;
if(fabs(a[i]-a[mid])<180){
ans = max(ans, fabs(a[i]-a[mid]));
bf = mid 1;
}
else {
ef = mid;
ans = max(ans, 360-fabs(a[i]-a[mid]));
}
}
}
printf("%.8lf\n", ans);
return 0;
}
感觉也不会有面试机会
OPPO公司福利 473人发布
