Submission #957848

#TimeUsernameProblemLanguageResultExecution timeMemory
957848imarnFeast (NOI19_feast)C++14
100 / 100
96 ms10580 KiB
#include<bits/stdc++.h> #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define f first #define s second #define pb push_back #define all(x) x.begin(),x.end() #define vi vector<int> #define vvi vector<vi> #define vp vector<pii> using namespace std; const int N=3e5+5; pll dp[N]; ll qs[N]{0}; int n,m,k; pll solve(ll x){ pll mex={0,0}; for(int i=1;i<=n;i++){ dp[i]=max(dp[i-1],{mex.f+qs[i]-x,mex.s-1}); mex=max(mex,{dp[i].f-qs[i],dp[i].s}); }return dp[n]; } int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>n>>k;dp[0]={0,0}; for(int i=1;i<=n;i++)cin>>qs[i],qs[i]+=qs[i-1]; ll l=0,r=1e12; while(l<r){ ll md=(l+r)>>1; if(-solve(md).s<=k)r=md; else l=md+1; }cout<<solve(l).f+l*k; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...