Submission #887233

#TimeUsernameProblemLanguageResultExecution timeMemory
887233vjudge1Baloni (COCI15_baloni)C++17
40 / 100
100 ms131072 KiB
#include <bits/stdc++.h> using namespace std; #define sp << " " << #define int long long #define vi vector<int> #define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++) #define pii pair<int,int> #define pb push_back void solve() { int n; cin >> n; vi a(n+1); F(i,n) cin >> a[i]; stack<int> bs[n+2]; vi nx(n+1); F(i,n) { if (!bs[a[i]+1].empty()) { nx[bs[a[i]+1].top()] = i; bs[a[i]+1].pop(); } bs[a[i]].push(i); } int c = 0; vi vis(n+1,0); F(i,n) { if (!vis[i]) { c++; int ptr = i; while (nx[ptr]) { vis[ptr] = 1; ptr = nx[ptr]; } vis[ptr] = 1; } } cout << c << endl; } signed main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #ifdef Local freopen("in","r",stdin); freopen("out","w",stdout); #endif int t = 1; //cin >> t; F(i,t) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...