Submission #1094226

#	Time	Username	Problem	Language	Result	Execution time	Memory
1094226		Trisanu_Das	Feast (NOI19_feast)	C++17	100 / 100	96 ms	10476 KiB

feast

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
 
int n, k, a[300005];
pair<int, int> dp[300005];
 
pair<int, int> calc(int mid){
    pair<int, int> curr(0,0);
    for(int i = 1; i <= n; i++){
        dp[i] = max(dp[i - 1], {curr.ff + a[i] - mid, curr.ss + 1});
        curr = max(curr, {dp[i].ff - a[i], dp[i].ss});
    }
    return dp[n];
}
 
signed main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) a[i] += a[i - 1];
    int l = 0, r = 3e14;
    while(l < r){
        int mid = (l + r + 1) / 2;
        if(calc(mid).ss >= k) l = mid;
        else r = mid - 1;
    }
    cout << calc(l).ff + l * k << '\n';
}

• 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