제출 #1025675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025675		fv3	Feast (NOI19_feast)	C++14	59 / 100	105 ms	262144 KiB

feast

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

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

	int N, K;
	cin >> N >> K;

	vector<ll> a(N);
	for (int i = 0; i < N; i++)
		cin >> a[i];

	// Maximize satisfaction with 1, then 2, then ... segments

	vector<vector<ll>> dp(K+1, vector<ll>(N));
	vector<vector<ll>> mx(K+1, vector<ll>(N));

	ll res = 0;
	for (int k = 1; k <= K; k++)
	{
		for (int i = 0; i < N; i++)
		{
			dp[k][i] = max(0ll, a[i]);

			if (i)
				dp[k][i] = max({dp[k][i], dp[k][i-1] + a[i], mx[k-1][i-1] + a[i]});


			mx[k][i] = dp[k][i];
			if (i)
				mx[k][i] = max(mx[k][i-1], dp[k][i]);

			res = max(res, mx[k][i]);
		}
	}

	cout << res << '\n';
	return 0;
}

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