제출 #981171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981171		beaboss	Feast (NOI19_feast)	C++14	0 / 100	10 ms	2652 KiB

feast

// Source: https://oj.uz/problem/view/NOI19_feast
// 

#include "bits/stdc++.h"

using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
typedef pair<int, int> pii;
#define s second
#define f first

const int N = 1e5 + 10;
int a[N];
pii dp[N][2];
int n, k;

pii solve(int l) {
	dp[0][0] = {0, 0};
	dp[0][1] = {a[0] - l, 1};

	FOR(i, 1, n) {
		dp[i][0] = max(dp[i-1][0], dp[i-1][1]);
		dp[i][1] = max(make_pair(dp[i-1][0].f + a[i] - l, dp[i-1][0].s + 1), make_pair(dp[i-1][1].f + a[i], dp[i-1][1].s));
	}
	return max(dp[n-1][1], dp[n-1][0]);

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> k;

	FOR(i, 0 ,n) cin >> a[i];

	int lo = 0;
	int hi = 1e9;

	while (lo < hi) {
		int m = (lo + hi + 1)/2;
		pii res = solve(m);
		// cout << res.s << k << endl;
		if (res.s >= k) lo = m;
		else hi = m -1;
	}
	// cout << lo << solve(lo).f << endl;
	cout << solve(lo).f + k * lo << endl;

}

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