# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375148 | AdiZer0 | Po (COCI21_po) | C++17 | 19 ms | 1132 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 whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)1e5 + 8;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e15 + 2;
int n, a[N];
int main() {
scanf ("%d", &n);
for (int i = 1; i <= n; ++i) scanf ("%d", a + i);
vector<int> v;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (!v.empty()) {
if (v.back() == a[i]) continue;
while (!v.empty() && v.back() > a[i]) v.pop_back();
}
if (v.empty() || v.back() < a[i]) ++cnt, v.pb(a[i]);
}
printf ("%d\n", cnt);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |