#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long a[100005];
/*pair<long long,long long> MinMax(long long l,long long r)
{
int64_t minn=-1,maxn=-1;
for(int i=1;i<=n;i++)
if(l<=a[i]&&a[i]<=r)
{
minn=a[i];
break;
}
for(int i=n;i>=1;i--)
if(l<=a[i]&&a[i]<=r)
{
maxn=a[i];
break;
}
return make_pair(minn,maxn);
}*/
long long findGap(int T, int n)
{
if(T==1)
{
long long L,R,preL,preR,res=0;
MinMax(0,1e18,&preL,&preR);
//preL=tmp.first;
//preR=tmp.second;
while(1)
{
MinMax(preL+1,preR-1,&L,&R);
//L=tmp.first;
//R=tmp.second;
if(L==-1)
{
res=max(res,preR-preL);
break;
}
res=max(res,max(L-preL,preR-R));
preL=L;
preR=R;
if(L==R)
break;
}
return res;
}
}
/*int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
cout<<findGap(1,n);
}*/
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
2 |
Correct |
0 ms |
5920 KB |
Output is correct |
3 |
Correct |
0 ms |
5920 KB |
Output is correct |
4 |
Correct |
0 ms |
5920 KB |
Output is correct |
5 |
Correct |
0 ms |
5920 KB |
Output is correct |
6 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
5920 KB |
Unexpected end of file - int64 expected |
11 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
5920 KB |
Output isn't correct |
17 |
Incorrect |
13 ms |
5920 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
5920 KB |
Output isn't correct |
19 |
Incorrect |
16 ms |
5920 KB |
Output isn't correct |
20 |
Incorrect |
9 ms |
5920 KB |
Unexpected end of file - int64 expected |
21 |
Incorrect |
63 ms |
5920 KB |
Output isn't correct |
22 |
Incorrect |
73 ms |
5920 KB |
Output isn't correct |
23 |
Incorrect |
59 ms |
5920 KB |
Output isn't correct |
24 |
Incorrect |
53 ms |
5920 KB |
Output isn't correct |
25 |
Incorrect |
53 ms |
5920 KB |
Output isn't correct |
26 |
Incorrect |
49 ms |
5920 KB |
Output isn't correct |
27 |
Incorrect |
63 ms |
5920 KB |
Output isn't correct |
28 |
Incorrect |
49 ms |
5920 KB |
Output isn't correct |
29 |
Incorrect |
49 ms |
5920 KB |
Output isn't correct |
30 |
Incorrect |
33 ms |
5920 KB |
Unexpected end of file - int64 expected |
31 |
Incorrect |
0 ms |
5920 KB |
Unexpected end of file - int64 expected |
32 |
Incorrect |
0 ms |
5920 KB |
Unexpected end of file - int64 expected |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
16 |
Incorrect |
6 ms |
5920 KB |
Output isn't correct |
17 |
Incorrect |
9 ms |
5920 KB |
Output isn't correct |
18 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
19 |
Incorrect |
3 ms |
5920 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
5920 KB |
Output isn't correct |
21 |
Incorrect |
29 ms |
5920 KB |
Output isn't correct |
22 |
Incorrect |
26 ms |
5920 KB |
Output isn't correct |
23 |
Incorrect |
26 ms |
5920 KB |
Output isn't correct |
24 |
Incorrect |
29 ms |
5920 KB |
Output isn't correct |
25 |
Incorrect |
23 ms |
5920 KB |
Output isn't correct |
26 |
Incorrect |
33 ms |
5920 KB |
Output isn't correct |
27 |
Incorrect |
33 ms |
5920 KB |
Output isn't correct |
28 |
Incorrect |
36 ms |
5920 KB |
Output isn't correct |
29 |
Incorrect |
26 ms |
5920 KB |
Output isn't correct |
30 |
Incorrect |
9 ms |
5920 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |