Submission #888246

#TimeUsernameProblemLanguageResultExecution timeMemory
888246pccMoney (IZhO17_money)C++14
0 / 100
1 ms4444 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define pii pair<int,int> #define fs first #define sc second #define tlll tuple<ll,ll,ll> #define tiii tuple<int,int,int> const int mxn = 1e6+10; int arr[mxn]; int n; int bit[mxn]; void modify(int p,int val){ for(;p<mxn;p+=p&-p)bit[p] += val; return; } int getval(int p){ int re = 0; for(;p>0;p-= p&-p)re += bit[p]; return re; } int main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n; for(int i = 1;i<=n;i++){ cin>>arr[i]; } int ans = 0; for(int i = n;i>=1;){ int now = arr[i]-getval(arr[i]); int pt; for(pt = i;arr[pt]-getval(arr[pt]) == now&&pt>0;pt--,now--)modify(arr[pt],1); ans++; //cout<<pt<<' '<<i<<endl; i = pt; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...