Submission #886171

#TimeUsernameProblemLanguageResultExecution timeMemory
886171vjudge1Airplane (NOI23_airplane)C++17
22 / 100
136 ms3540 KiB
#include <bits/stdc++.h> using namespace std; #define int int64_t int32_t main() { int n, m; cin>>n>>m; vector<int> a(n); for(int i=0; i<n; i++) cin>>a[i]; for(int i=0; i<m; i++) { int tmp; cin>>tmp>>tmp; } int cur = 0, ans = 0; vector<int> sufmax(n); sufmax[n-1] = a[n-1]; for(int i=n-2; i>=0; i--) sufmax[i] = max(sufmax[i+1], a[i]); for(int i=0; i<n-1; i++) { if(cur + 1 < a[i+1]) { ans += a[i+1]-1-cur; cur += a[i+1]-1-cur; } if(sufmax[i+1] > cur) { cur++; ans++; } else if(sufmax[i+1] < cur) { cur--; ans++; } else ans++; } ans += cur; cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...