#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=(c);i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3aFGabX ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
const int _n=1000011; // fix me
set<int> rbts[_n+11];
signed main(){
_3aFGabX;
int n;
cin>>n;
vi a(n);
rep(i,n){
cin>>a[i];
rbts[a[i]].insert(i);
}
// print(sz(rbts[1]));
int res=0;
for(int i=_n;i>=1;i--){
while(sz(rbts[i])){
res+=1;
int v=i,j=-1;
while(v and sz(rbts[v])){
auto it=rbts[v].lower_bound(j);
if(it!=rbts[v].end()){
j=*it;
rbts[v].erase(it);
}else{
break;
}
v-=1;
}
}
}
print(res);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
47316 KB |
Output is correct |
2 |
Correct |
26 ms |
47316 KB |
Output is correct |
3 |
Correct |
27 ms |
47484 KB |
Output is correct |
4 |
Correct |
26 ms |
47500 KB |
Output is correct |
5 |
Correct |
775 ms |
87416 KB |
Output is correct |
6 |
Correct |
813 ms |
92368 KB |
Output is correct |
7 |
Correct |
677 ms |
84432 KB |
Output is correct |
8 |
Correct |
603 ms |
84008 KB |
Output is correct |
9 |
Correct |
660 ms |
86068 KB |
Output is correct |
10 |
Correct |
749 ms |
87580 KB |
Output is correct |