//多重背包 max
#include <iostream>
using namespace std;
const int N = ;
int n, m;
int f[N];
int main() {
cin >> n >> m;
for (int i = ; i < n; i ++ ) {
int v,...
#include <iostream>
using namespace std;
const int N = , M = ;
int n, m;
int ne[N];//ne[i] : 以i为结尾的部分匹配的值
char s[M], p[N];
int main() {
cin >> n >> p + >> m ...
//二进制优化 最后变为01背包
#include <iostream>
#include <algorithm>
using namespace std;
const int N = , M = ;
int n, m;
int v[N], w[N];
int f[M];
int main() {
cin >> n &g...