ch 5e01 线性dp

把ka[tt]++写成ka[tt++]，找半天没找到错误

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace::std;

int n, m, a[355], ka[6],tt;
int f[355][44][44][44],ans;

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", a + i);
	for (int i = 1; i <= m; i++)scanf("%d", &tt), ka[tt]++;

	memset(f, -1, sizeof(f));
	f[1][0][0][0] = a[1];
	for (int i = 1; i <= n; i++) 
		for (int j = 0; j <= ka[1]; j++) 
			for (int k = 0; k <= ka[2]; k++) 
				for (int l = 0; l <= ka[3]; l++) {
					if (f[i][j][k][l] < 0) continue;
					ans = max(ans, f[i][j][k][l]);
					if (j < ka[1] && i + 1 <= n)//
						f[i + 1][j + 1][k][l] = max(f[i + 1][j + 1][k][l], f[i][j][k][l] + a[i + 1]);
					if (k < ka[2] && i + 2 <= n)
						f[i + 2][j][k + 1][l] = max(f[i + 2][j][k + 1][l], f[i][j][k][l] + a[i + 2]);
					if (l < ka[3] && i + 3 <= n)
						f[i + 3][j][k][l + 1] = max(f[i + 2][j][k + 1][l], f[i][j][k][l] + a[i + 3]);
					if ((n - j - 2 * k - 3 * l) / 4 <= ka[4] && i + 4 <= n)
						f[i + 4][j][k][l] = max(f[i + 4][j][k][l], f[i][j][k][l] + a[i + 4]);
				}

	printf("%d\n", ans);

	return 0;
}