Submission #949760

#	Time	Username	Problem	Language	Result	Execution time	Memory
949760		steveonalex	Feast (NOI19_feast)	C++14	41 / 100	1103 ms	12628 KiB

feast

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3e5;

int n, k;
ll a[N];
ll pref[N];

pair<ll, int> dp[N];

void update(pair<ll, int> &a, pair<ll, int> b){
    if (a.first < b.first) a = b;
    else if (a.first == b.first && a.second > b.second) a = b;
}

pair<ll, int> go(ll lambda){
    for(int i = 0; i<=n; ++i) dp[i] = {0, 0};
    for(int i = 1; i<=n; ++i){
        update(dp[i], dp[i-1]);

        for(int j = i; j>=1; --j){
            ll sum = pref[i] - pref[j-1];
            update(dp[i], {dp[j-1].first + sum - lambda, dp[j-1].second + 1});
        }
    }
    return dp[n];
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> k;
    for(int i= 1; i<=n; ++i) cin >> a[i];
    for(int i = 1; i<=n; ++i) pref[i] = pref[i-1] + a[i];

    ll l = 0, r = 1e14;
    while(l < r){
        ll mid = (l + r) >> 1;
        if (go(mid).second <= k) r = mid;
        else l = mid + 1;
    }
    pair<ll, int> eww = go(l);
    cout << eww.first + k * l << "\n";

    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