제출 #237746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237746		Haunted_Cpp	Feast (NOI19_feast)	C++17	41 / 100	96 ms	37496 KiB

feast

#include <bits/stdc++.h>
using namespace std;

const int N = 2005;

bool calc [N][N][2];
long long dp [N][N][2];
long long arr [N];

int n, k;

long long solve (int p, int box, bool is) {

  if (box < 0) return -1e15;  
  if (p >= n) return (box >= 0 ? 0 : -1e15);
  if (calc[p][box][is]) return dp[p][box][is];
  
  long long &res = dp[p][box][is];
  calc[p][box][is] = true;
  
  res = -1e15;
  
  if (!is) {
    res = max (res, solve (p + 1, box, false) );
    res = max (res, solve (p + 1, box - 1, true) + arr[p]);
  } else {
    res = max (res, solve (p + 1, box, true) + arr[p]);
    res = max (res, solve (p + 1, box, false) );
  }

  return res;
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  memset (calc, false, sizeof(calc));
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  cout << solve (0, k, false) << '\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