#include<bits/stdc++.h>
using namespace std;
const int nmax=(1<<20)+42;
int n;
pair<int,int> inp[nmax];
int tree[2*nmax];
void build(int node,int l,int r)
{
if(l==r)
{
tree[node]=inp[l].first;
return;
}
int av=(l+r)/2;
build(node*2,l,av);
build(node*2+1,av+1,r);
tree[node]=max(tree[node*2],tree[node*2+1]);
}
int query(int node,int l,int r,int lq,int rq)
{
if(l==lq&&r==rq)return tree[node];
int av=(l+r)/2,ret=-1e9;
if(lq<=av)ret=max(ret,query(node*2,l,av,lq,min(av,rq)));
if(av<rq)ret=max(ret,query(node*2+1,av+1,r,max(av+1,lq),rq));
return ret;
}
int output;
int main()
{
scanf("%i",&n);
int mini,maxi;
for(int i=1;i<=n;i++)
scanf("%i%i",&inp[i].first,&inp[i].second);
build(1,1,n);
int l=1,r=1;
while(r<=n)
{
if(query(1,1,n,l,r)<=inp[r].second)r++;
else l++;
output=max(output,r-l);
}
printf("%i\n",output);
return 0;
}
Compilation message
tem.cpp: In function 'int main()':
tem.cpp:34:9: warning: unused variable 'mini' [-Wunused-variable]
int mini,maxi;
^~~~
tem.cpp:34:14: warning: unused variable 'maxi' [-Wunused-variable]
int mini,maxi;
^~~~
tem.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&n);
~~~~~^~~~~~~~~
tem.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i%i",&inp[i].first,&inp[i].second);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
372 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
5 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
632 KB |
Output is correct |
2 |
Correct |
9 ms |
632 KB |
Output is correct |
3 |
Correct |
12 ms |
632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
326 ms |
8676 KB |
Output is correct |
2 |
Correct |
192 ms |
9088 KB |
Output is correct |
3 |
Correct |
281 ms |
13688 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
544 ms |
14832 KB |
Output is correct |
2 |
Correct |
612 ms |
15352 KB |
Output is correct |
3 |
Correct |
465 ms |
15352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
653 ms |
15096 KB |
Output is correct |
2 |
Correct |
618 ms |
15456 KB |
Output is correct |
3 |
Correct |
560 ms |
14984 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
735 ms |
15648 KB |
Output is correct |
2 |
Correct |
629 ms |
27256 KB |
Output is correct |
3 |
Runtime error |
706 ms |
36916 KB |
Memory limit exceeded (if you are sure your verdict is not MLE, please contact us) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
700 ms |
14968 KB |
Output is correct |
2 |
Correct |
468 ms |
15480 KB |
Output is correct |
3 |
Correct |
625 ms |
15480 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
560 ms |
15460 KB |
Output is correct |
2 |
Correct |
417 ms |
15608 KB |
Output is correct |
3 |
Correct |
308 ms |
15608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
553 ms |
15204 KB |
Output is correct |
2 |
Correct |
435 ms |
15644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
600 ms |
14712 KB |
Output is correct |
2 |
Correct |
629 ms |
15992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
592 ms |
14456 KB |
Output is correct |
2 |
Correct |
589 ms |
15352 KB |
Output is correct |