Submission #988360

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
988360	2024-05-24 14:36:15	vjudge1	Feast (NOI19_feast)	C++17	12 / 100	224 ms	23912 KiB

feast

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int n, k;
vector<long long> a;
vector<vector<pair<long long, long long> > > DP;
pair<long long, long long> dp(long long lambda)
{
  DP[0][0] = { 0, 0 };
  for (int i = 1; i <= n; i++)
  {
    DP[i][0] = max(DP[i - 1][0], DP[i - 1][1]);
    DP[i][1] = max(
      make_pair(DP[i - 1][0].first + a[i] - lambda, DP[i - 1][0].second + 1),
      make_pair(DP[i - 1][1].first + a[i], DP[i - 1][1].second)
    );
  }
  return max(DP[n][0], DP[n][1]);
}
int main()
{
  cin >> n >> k;
  DP.resize(n + 1, vector<pair<long long, long long>>(2, { LLONG_MIN, 0 }));
  a.resize(n + 1);
  for (int i = 1; i <= n; i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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