Submission #986190

#	Time	Username	Problem	Language	Result	Execution time	Memory
986190		12345678	Feast (NOI19_feast)	C++17	100 / 100	105 ms	6088 KiB

feast

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e5+5;

ll n, k, qs[nx];

pair<ll, ll> solve(ll c)
{
    pair<ll, ll> mx, dp;
    for (int i=1; i<=n; i++)
    {
        dp=max(dp, {mx.first+qs[i]-c, mx.second+1});
        mx=max(mx, {dp.first-qs[i], dp.second});
    }
    return dp;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>qs[i], qs[i]+=qs[i-1];
    ll l=0, r=3e14+5;
    while (l<r)
    {
        ll md=(l+r)/2;
        if (solve(md).second>k) l=md+1;
        else r=md;
    }
    cout<<solve(l).first+solve(l).second*l;
}

• 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