# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702656 | stevancv | Baloni (COCI15_baloni) | C++14 | 85 ms | 30940 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 ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 2e9;
vector<int> pos[N];
int ans[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
for (int i = 1; i <= n; i++) {
int x; cin >> x;
if (!pos[x + 1].empty()) {
int j = pos[x + 1].back();
pos[x + 1].pop_back();
ans[j] = 0;
}
ans[i] = 1;
pos[x].push_back(i);
}
int sum = 0;
for (int i = 1; i <= n; i++) sum += ans[i];
cout << sum << en;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |