# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
512027 | kartel | Po (COCI21_po) | C++14 | 44 ms | 3476 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 pb push_back
#define F first
#define S second
#define sz(x) (int)x.size()
using namespace std;
const int N = 1e5 + 500;
int r[N];
bool mk[N];
int main() {
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector <int> b = {a[0]};
for (int i = 1; i < n; i++) {
if (a[i] != b.back()) {
b.pb(a[i]);
}
}
a = b;
vector <pair <int, int> > st;
st.pb({-1, sz(a)});
for (int i = sz(a) - 1; i >= 0; i--) {
while (sz(st) && st.back().F > a[i]) {
st.pop_back();
}
r[i] = st.back().S;
st.pb({a[i], i});
}
n = sz(a);
int ans = 0;
for (int i = 0; i < n; i++) {
if (mk[i]) {
continue;
}
ans += (a[i] > 0);
mk[r[i] - 1] = 1;
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |