#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll mod2=998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n;
int a[100009],done[100009],here[100009];
vi v[100009];
int main(){
fast;
cin>>n;
int num=0;
for(int i=0;i<n;i++)cin>>a[i],v[a[i]].pb(i);
for(int i=0;i<n;i++){
if(done[i])C;
num++;
int crnt=a[i];
int last=i-1;
while(crnt){
if(v[crnt].size()==0)break;
if(v[crnt][here[crnt]]<last)break;
done[v[crnt][here[crnt]]]=1;
last=v[crnt][here[crnt]];
here[crnt]++;
crnt--;
}
}
cout<<num<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
2680 KB |
Output isn't correct |
| 2 |
Incorrect |
4 ms |
2808 KB |
Output isn't correct |
| 3 |
Incorrect |
4 ms |
2808 KB |
Output isn't correct |
| 4 |
Incorrect |
5 ms |
2808 KB |
Output isn't correct |
| 5 |
Incorrect |
18 ms |
4088 KB |
Output isn't correct |
| 6 |
Incorrect |
16 ms |
3832 KB |
Output isn't correct |
| 7 |
Incorrect |
15 ms |
3832 KB |
Output isn't correct |
| 8 |
Incorrect |
15 ms |
3832 KB |
Output isn't correct |
| 9 |
Incorrect |
17 ms |
3832 KB |
Output isn't correct |
| 10 |
Incorrect |
15 ms |
3704 KB |
Output isn't correct |
