Submission #230723

#TimeUsernameProblemLanguageResultExecution timeMemory
230723syyBaloni (COCI15_baloni)C++17
0 / 100
84 ms14456 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++) #define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--) typedef pair<int, int> pi; #define f first #define s second #define pb push_back #define all(v) v.begin(), v.end() #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) int n, arr[1000005], mi[1000005], ans; stack<int> s; int main() { fastio; cin >> n; FOR(i, 1, n) cin >> arr[i]; mi[n] = arr[n]; DEC(i, n-1, 1) mi[i] = min(mi[i+1], arr[i]); FOR(i, 1, n) { if (!s.empty() and s.top() == arr[i]+1) s.top()--; else { s.push(arr[i]); ans++; } if (!s.empty() and s.top() == mi[i]) s.pop(); } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...