Problem p03032 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER                                                                 \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0)
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
  return out << "(" << a.first << "," << a.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &a) {
  for (const A &it : a)
    out << it << " ";
  return out;
}
template <class A, class B> istream &operator>>(istream &in, pair<A, B> &a) {
  return in >> a.first >> a.second;
}
template <class A> istream &operator>>(istream &in, vector<A> &a) {
  for (A &i : a)
    in >> i;
  return in;
}
// ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a, int b, const int &m = MOD) {
  if (b == 0)
    return 1;
  int x = poww(a, b / 2, m);
  x = x * x % m;
  if (b & 1)
    x = x * a % m;
  return x;
}
int ceil(const int &a, const int &b) { return (a + b - 1) / b; }
////Read:
// Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),

int n, c, dp[55][55][55][55];
vi v;

int f(int i, int cnt, int mxgap, int lst) {
  if (i == n) {
    mxgap = max(mxgap, i - lst - 1);
    if (cnt + (n - cnt - mxgap) * 2 <= c)
      return 0;
    return -INF;
  }
  int &ans = dp[i][cnt][mxgap][lst + 1];
  if (ans != -INF)
    return ans;
  ans = v[i] + f(i + 1, cnt + 1, max(mxgap, i - lst - 1), i);
  ans = max(ans, f(i + 1, cnt, mxgap, lst));
}

signed main() {
  FASTER;
  cin >> n >> c;
  v = vi(n);
  cin >> v;
  for (int i = 0; i < 55; i++) {
    for (int j = 0; j < 55; j++) {
      for (int k = 0; k < 55; k++) {
        for (int l = 0; l < 55; l++) {
          dp[i][j][k][l] = -INF;
        }
      }
    }
  }
  cout << f(0, 0, 0, -1);
}


Fixed submission:
#include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER                                                                 \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0)
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
  return out << "(" << a.first << "," << a.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &a) {
  for (const A &it : a)
    out << it << " ";
  return out;
}
template <class A, class B> istream &operator>>(istream &in, pair<A, B> &a) {
  return in >> a.first >> a.second;
}
template <class A> istream &operator>>(istream &in, vector<A> &a) {
  for (A &i : a)
    in >> i;
  return in;
}
// ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a, int b, const int &m = MOD) {
  if (b == 0)
    return 1;
  int x = poww(a, b / 2, m);
  x = x * x % m;
  if (b & 1)
    x = x * a % m;
  return x;
}
int ceil(const int &a, const int &b) { return (a + b - 1) / b; }
////Read:
// Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),

int n, c, dp[55][55][55][55];
vi v;

int f(int i, int cnt, int mxgap, int lst) {
  if (i == n) {
    mxgap = max(mxgap, i - lst - 1);
    if (cnt + (n - cnt - mxgap) * 2 <= c)
      return 0;
    return -INF;
  }
  int &ans = dp[i][cnt][mxgap][lst + 1];
  if (ans != -INF)
    return ans;
  ans = v[i] + f(i + 1, cnt + 1, max(mxgap, i - lst - 1), i);
  ans = max(ans, f(i + 1, cnt, mxgap, lst));
  return ans;
}

signed main() {
  FASTER;
  cin >> n >> c;
  v = vi(n);
  cin >> v;
  for (int i = 0; i < 55; i++) {
    for (int j = 0; j < 55; j++) {
      for (int k = 0; k < 55; k++) {
        for (int l = 0; l < 55; l++) {
          dp[i][j][k][l] = -INF;
        }
      }
    }
  }
  cout << f(0, 0, 0, -1);
}