Submission #1103166

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103166		0pt1mus23	Feast (NOI19_feast)	C++14	41 / 100	32 ms	16464 KiB

feast

#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ins insert      
#define pb push_back
#define endl '\n'
#define putr(x) cout<<x<<endl;return; 
#define all(x) x.begin(),x.end()
// mt19937 rng(time(0));
const int mod = 1e9 +9, sze = 2e5 +23, inf = LLONG_MAX, LL = 30;
// Lagrangian Relaxation - Usaco Guide
pair<int,int> dp[2][sze];
int arr[sze];
int n;
void clc(int mid){
    dp[1][0]={arr[0]-mid,1}; 
    dp[0][0]={0,0};
    for(int i=1;i<n;i++){
        dp[0][i]=max(dp[0][i-1],dp[1][i-1]);
        dp[1][i]=max(
            make_pair(dp[0][i-1].first + arr[i]-mid,dp[0][i-1].second +1),
            make_pair(dp[1][i-1].first + arr[i],dp[1][i-1].second)
        );
    }    
}

void rush(){
    int k;
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }

    int l =0;
    int r = 1e18;
    int ans=0;
    while(l<=r){
        int mid = (l+r)/2;
        clc(mid);
        auto mx = max(dp[1][n-1],dp[0][n-1]);
        if(mx.second >=k ){
            ans=mid;
            l=mid+1;
        }
        else{
            r = mid-1;
        }
    }

    clc(ans);
    auto mx = max(dp[1][n-1],dp[0][n-1]);
    putr( k*ans + mx.first );
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tt = 1;

    // cin>>tt;
    while(tt--){
        rush();
    }
 
    return 0;
}

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