#include <bits/stdc++.h>
using namespace std;
int n;
int pre[2000005];
map<int,int> cmp;
int main(){
cin>>n;
int la = 2;
set<int> s;
int arr[n],so[n];
for(int i = 0;i<n;i++){
cin>>arr[i];
so[i] = arr[i];
}
sort(so,so+n);
long long z = 1;
for(auto i:s){
cmp[i] = ++z;
}
for(int i = 0;i<n;i++){
if(la<cmp[arr[i]]*2){
pre[la]++;
pre[cmp[arr[i]]*2]--;
}
la = cmp[arr[i]]*2;
}
int ma = 0;la = 0;
for(int i = 2;i<=z*2;i++){
la+=pre[i];
ma = max(ma,la);
}
cout<<ma<<"\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
22 ms |
1436 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
75 ms |
6476 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1049 ms |
47512 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1081 ms |
35584 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |