#include <bits/stdc++.h>
using namespace std;
long long n;
int pre[3000001];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n;
vector<long long> v,w;
v.push_back(2);
map<long long,long long> sa,cmp;
for(int i = 0;i<n;i++){
long long x;cin>>x;
w.push_back(x);
sa[x]++;
}
long long z = 2;
for(auto i:sa){
cmp[i.first] = z++;
}
for(int i = 0;i<n;i++){
v.push_back(cmp[w[i]]*2);
}
for(int i = 0;i<n;i++){
if(v[i]<v[i+1]){
pre[v[i+1]]--;
pre[v[i]]++;
}
}
long long ma = 0 , cur = 0;
for(int i = 2;i<(n+2)*2;i++){
cur+=pre[i];
ma = max(ma,cur);
}
cout<<ma<<"\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
468 KB |
Output is correct |
5 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
2640 KB |
Output is correct |
2 |
Correct |
13 ms |
2628 KB |
Output is correct |
3 |
Correct |
15 ms |
2552 KB |
Output is correct |
4 |
Correct |
12 ms |
2560 KB |
Output is correct |
5 |
Correct |
12 ms |
2640 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
110 ms |
15204 KB |
Output is correct |
2 |
Correct |
62 ms |
15256 KB |
Output is correct |
3 |
Correct |
96 ms |
15200 KB |
Output is correct |
4 |
Correct |
99 ms |
15300 KB |
Output is correct |
5 |
Correct |
96 ms |
15264 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
809 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
999 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |