Submission #1097193

#	Time	Username	Problem	Language	Result	Execution time	Memory
1097193		crafticat	Feast (NOI19_feast)	C++17	41 / 100	1029 ms	26856 KiB

feast

#include "bits/stdc++.h"

using namespace std;
template<typename T>
using V = vector<T>;
using ll = long long;
using pi = pair<ll, ll>;
#define ckmax(a,b) a= max(a,b)

inline std::pair<long long, long long> operator-(const std::pair<long long, long long>& p1, const std::pair<long long, long long>& p2) {
    return {p1.first - p2.first, p1.second - p2.second};
}

pi solve(V<ll>&arr, ll k, ll p) {
    V<V<pi>> dp(arr.size() + 1, V<pi>(2, {-1e18,0}));
    dp[0][0] = {0,0};pi pa = make_pair(p,-1);


    for (ll i = 1; i <= arr.size(); ++i) {
        dp[i][0] = {0,0};
        for (ll l = 0; l < 2; ++l) {
            ckmax(dp[i][l], max(dp[i - 1][1] - pa, dp[i - 1][1]));
            ckmax(dp[i][l], dp[i - 1][0] - pa);
        }
        ckmax(dp[i][0], dp[i - 1][0]);
        dp[i][1].first += arr[i - 1];
    }

    return max(dp[arr.size()][0], dp[arr.size()][1]);
}

int main() {
    ll n, k; cin >> n >> k;

    V<ll> arr(n);
    for (ll i = 0; i < n; ++i) {
        cin >> arr[i];
    }


    ll l = 0, r = 1e18;
    int iter = 0;
    while (r > l) {
        ll mid = l + (r - l + 1) / 2;
        if (solve(arr, k, mid).second >= k)
            l = mid;
        else
            r = mid - 1;

        iter++;
        if (iter > 62) exit(5);
    }

    cout << solve(arr,k,l).first + l * k << "\n";
}

Compilation message (stderr)

feast.cpp: In function 'pi solve(V<long long int>&, ll, ll)':
feast.cpp:19:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (ll i = 1; i <= arr.size(); ++i) {
      |                    ~~^~~~~~~~~~~~~

• 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