codeforces 148E Porcelain(DP， 分组背包)

rep(r, 1, n) {
scanf("%d", &t);
rep(i, 1, t) scanf("%d", a+i);

rep(i, 1, t) pre[i] = pre[i-1]+a[i];
rep(i, 1, t) suf[i] = suf[i-1]+a[t-i+1];

rep(i, 1, t) {
v[i] = 0;
rep(j, 0, i) v[i] = max (v[i], pre[j]+suf[i-j]);
}

urep(w, m, 1) {
for (int i=1;i<=t && i<=w;++i)
dp[w] = max (dp[w], dp[w-i] + v[i]);
}
}
printf("%d", dp[m]);