# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489545 | mychecksedad | Baloni (COCI15_baloni) | C++17 | 94 ms | 27360 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>
using namespace std;
const int N = 1e6 + 100;
int n, arr[N];
vector<vector<int>> pos(N);
int main(){
cin.tie(0); ios::sync_with_stdio(0);
cin >> n;
for(int i = 0; i < n; ++i) cin >> arr[i];
int ans = 0;
for(int i = 0; i < n; ++i){
if(pos[arr[i] + 1].empty()){
++ans;
}else pos[arr[i] + 1].pop_back();
pos[arr[i]].push_back(i);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |