Submission #935814

# Submission time Handle Problem Language Result Execution time Memory
935814 2024-02-29T14:44:13 Z imarn Feast (NOI19_feast) C++14
0 / 100
139 ms 12124 KB
#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]+x,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=1e16;
    while(l<r){
        ll m=(l+r)>>1;
        if(solve(m,n).s<=k)r=m;
        else l=m+1;
    }cout<<max(solve(l,n).f+l*k,1ll*0);
}
# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 11944 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 90 ms 12124 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 12112 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 11944 KB Output isn't correct
2 Halted 0 ms 0 KB -