#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include "gap.h"
// static void my_assert(int k){ if (!k) exit(1); }
// static int subtask_num, N;
// static long long A[100001];
// static long long call_count;
using namespace std;
#define ff first;
#define ss second
#define pb push_back
//#define int long long
long long a[200005],tl,tr,l,r,mx;
// void MinMax(long long s, long long t, long long *mn, long long *mx)
// {
// int lo = 1, hi = N, left = N+1, right = 0;
// my_assert(s <= t && mn != NULL && mx != NULL);
// while (lo <= hi){
// int mid = (lo+hi)>>1;
// if (A[mid] >= s) hi = mid - 1, left = mid;
// else lo = mid + 1;
// }
// lo = 1, hi = N;
// while (lo <= hi){
// int mid = (lo+hi)>>1;
// if (A[mid] <= t) lo = mid + 1, right = mid;
// else hi = mid - 1;
// }
// if (left > right) *mn = *mx = -1;
// else{
// *mn = A[left];
// *mx = A[right];
// }
// if (subtask_num == 1) call_count++;
// else if (subtask_num == 2) call_count += right-left+2;
// }
long long findGap(int sub,int n){
mx=0;
l=1;
r=n;
tl=0;
tr=1e18;
while(l<=r){
MinMax(tl,tr,&a[l],&a[r]);
tl=a[l]+1;
tr=a[r]-1;
l++;
r--;
}
for(int i=2;i<=n;i++){
mx=max(mx,a[i]-a[i-1]);
}
return mx;
}
// int main()
// {
// cin>>N;
// for (int i=1;i<=N;i++) cin>>A[i];
// printf("%lld\n", findGap(subtask_num, N));
// printf("%lld\n", call_count);
// }
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2508 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2648 KB |
Output is correct |
| 17 |
Correct |
5 ms |
2736 KB |
Output is correct |
| 18 |
Correct |
7 ms |
2644 KB |
Output is correct |
| 19 |
Correct |
5 ms |
2736 KB |
Output is correct |
| 20 |
Correct |
4 ms |
2648 KB |
Output is correct |
| 21 |
Correct |
21 ms |
3448 KB |
Output is correct |
| 22 |
Correct |
21 ms |
3348 KB |
Output is correct |
| 23 |
Correct |
28 ms |
3416 KB |
Output is correct |
| 24 |
Correct |
21 ms |
3408 KB |
Output is correct |
| 25 |
Correct |
19 ms |
3416 KB |
Output is correct |
| 26 |
Correct |
21 ms |
3416 KB |
Output is correct |
| 27 |
Correct |
21 ms |
3416 KB |
Output is correct |
| 28 |
Correct |
21 ms |
3412 KB |
Output is correct |
| 29 |
Correct |
26 ms |
3408 KB |
Output is correct |
| 30 |
Correct |
18 ms |
3412 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 12 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 15 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 16 |
Partially correct |
6 ms |
2648 KB |
Partially correct |
| 17 |
Partially correct |
6 ms |
2648 KB |
Partially correct |
| 18 |
Partially correct |
7 ms |
2528 KB |
Partially correct |
| 19 |
Partially correct |
9 ms |
2648 KB |
Partially correct |
| 20 |
Partially correct |
6 ms |
2648 KB |
Partially correct |
| 21 |
Incorrect |
22 ms |
3296 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
28 ms |
3424 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
24 ms |
3416 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
30 ms |
3408 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
19 ms |
3324 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
23 ms |
3312 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
29 ms |
3412 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
22 ms |
3416 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
23 ms |
3408 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
17 ms |
3416 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
