# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375159 | Kalashnikov | Po (COCI21_po) | C++17 | 29 ms | 2172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#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 all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
int a[N] , f[N];
int get(int x) {
int res = 0;
for(; x > 0; x &= x+1 , x--) {
res += f[x];
}
return res;
}
void upd(int pos) {
for(; pos < N; pos |= pos+1) {
f[pos] ++;
}
}
void solve() {
int n;
cin >> n;
vector<pair<int,int>> v;
for(int i = 1; i <= n; i ++) {
cin >> a[i];
v.push_back({a[i] , -i});
}
sort(all(v));
reverse(all(v));
int cmp = 0 , ans = 0;
for(int i = 0; i < n; i ++) {
int last = -1 , cur = 0;
while(i+1 < n && v[i].F == v[i+1].F) {
v[i].S = -v[i].S;
cur ++;
if(last == -1) last = v[i].S , upd(v[i].S);
else {
upd(v[i].S);
if(get(v[i].S) - get(last) == v[i].S - last) cur --;
last = v[i].S;
}
i ++;
}
v[i].S = -v[i].S;
cur ++;
if(last == -1) last = v[i].S , upd(v[i].S);
else {
upd(v[i].S);
if(get(v[i].S) - get(last) == v[i].S - last) cur --;
last = v[i].S;
}
ans += cur;
}
cout << ans;
}
/*
*/
main() {
ios;
int tt = 1;
//cin >> tt;
while(tt --) {
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |