# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480022 | David_M | Po (COCI21_po) | C++14 | 25 ms | 24780 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 F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e18, P=998244353;
ll q=1, n, m, x, y, z, l, r, k, a[N], b[N], f[N], ans, o, u, Ans[N];
vector <pii> v[N], V;
stack <int> s;
main(){ios_base::sync_with_stdio(false), cin.tie(0);
cin>>n;
for(int i=1; i<=n; i++){
cin>>a[i];
if(a[i]==a[i-1])continue;
if(a[i]>a[i-1]){
s.push(a[i]-a[i-1]);
ans++;
}else{
l=s.top();s.pop();
r=a[i-1]-a[i];
while(r>l){
r-=l;
l=s.top();
s.pop();
}
if(r<l)ans++,s.push(l-r);
}
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |