Submission #935823

#	Time	Username	Problem	Language	Result	Execution time	Memory
935823		imarn	Feast (NOI19_feast)	C++14	100 / 100	108 ms	15440 KiB

feast

#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;
ll a[N]{0};
pll dp[N];
pll mx[N];
pll solve(ll x,int n){
    dp[0]=mx[0]={0,0};
    for(int i=1;i<=n;i++){
        dp[i] = max(dp[i-1],{mx[i-1].f+a[i]-x,mx[i-1].s-1});
        mx[i] = max(mx[i-1],{dp[i].f-a[i],dp[i].s});
    }return dp[n];
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,k;cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i],a[i]+=a[i-1];
    ll l=0,r=1e12;
    while(l<r){
        ll m=(l+r)>>1;
        if(-solve(m,n).s<=k)r=m;
        else l=m+1;
    }
    cout<<solve(l,n).f+l*k;
}

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 29 / 29