//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x << " = " << x << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;
const ll N = 1e6+5;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;
using namespace std;
ll a[N] , l[N] , r[N] , cnt[N];
pii p[N];
void solve(){
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
p[i] = {a[i] , i};
}
sort(p+1,p+1+n);
for(int i = 1; i <= n; i++){
if(a[p[i-1].S] != a[p[i].S]) l[a[p[i].S]] = a[p[i-1].S];
if(a[p[i+1].S] != a[p[i].S]) r[a[p[i].S]] = a[p[i+1].S];
}
ll ans = 0;
for(int i = n; i >= 1; i--){
int j = i , b = a[i];
bool ok = 0;
while(j-1 >= 1){
if(a[j-1] == l[b] && (b == a[i] || cnt[b] == 1)) b = l[b];
else if(a[j-1] != b) break;
cnt[a[j]]--;
j--;
}
cnt[a[j]]--;
if(cnt[a[i]] == 0 && cnt[a[j]] == 0) r[l[a[j]]] = r[a[i]] , l[r[a[i]]] = l[a[j]];
else if(cnt[a[i]] == 0) r[a[j]] = r[a[i]];
else if(cnt[a[j]] == 0) l[a[i]] = l[a[j]];
i = j;
ans++;
}
cout << ans << "\n";
}
signed main(){
ios;
solve();
return 0;
}
/*
8
710010
388188
309143
388188 710010
388188 710010
484815
*/
Compilation message
money.cpp: In function 'void solve()':
money.cpp:54:8: warning: unused variable 'ok' [-Wunused-variable]
54 | bool ok = 0;
| ^~
| # |
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 |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
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 |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
