813D:
题意:给出长度为n的序列,从中找出2个子序列,满足每个子序列相邻两数之间要么相差1,要么同余于7,求这两个子序列的最长长度和。(2个子串不能有重复)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
const int maxn = 5e3 + 50;
int f[maxn][maxn];//f[第一个子串的结尾][第二个子串的结尾] = maxlen;
int mod[8], pos[100005], s[maxn];
int main()
{
// freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &s[i]);
int ans = -1;
memset(f, 0, sizeof(f));
for(int i = 0; i < n; i++)//结束点小的串
{
memset(pos, 0, sizeof(pos));
memset(mod, 0, sizeof(mod));
for(int j = 1; j <= n; j++)//结束点大的串
{
//f[i][j] 从f[i][k](k<j) 转移。(固定i)
if(j < i)
{
mod[s[j] % 7] = max(mod[s[j] % 7], f[i][j]);//用空间换时间,决策集合只增加不减少;
pos[s[j]] = max(pos[s[j]], f[i][j]);
continue;
}
if(j == i) continue;//结束点不能一样。
f[i][j] = max(f[i][j], mod[s[j] % 7] + 1);
f[i][j] = max(f[i][j], pos[s[j] - 1] + 1);
f[i][j] = max(f[i][j], pos[s[j] + 1] + 1);
f[i][j] = max(f[i][j], f[i][0] + 1);//以j结尾的子串就一个s[j];
f[j][i] = f[i][j];//对称
mod[s[j] % 7] = max(mod[s[j] % 7], f[i][j]);
pos[s[j]] = max(pos[s[j]], f[i][j]);
ans = max(ans, f[i][j]);
}
}
printf("%d\n", ans);
return 0;
}
796E:
题意:有n道题目,有两个人分别会做某些题目,有p次偷看机会,每次可以偷看某个人最多连续k道题目,求最多偷看几道题目。
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int maxn = 1e3 + 50;
int dp[2][maxn][55][55];//滚动数组: dp[题目1->i][看j次][剩下的看A的题目数][剩下的看B的题目数]
int A[maxn], B[maxn];
void upd(int &x, int y)
{
x = max(x, y);
}
int main()
{
// freopen("in.txt", "r", stdin);
int n, p, k, x, r;
scanf("%d%d%d", &n, &p, &k);
for(int i = 1; i <= n; i++) A[i] = B[i] = 0;
scanf("%d", &r);
for(int i = 1; i <= r; i++)
{
scanf("%d", &x);
A[x] = 1;
}
scanf("%d", &r);
for(int i = 1; i <= r; i++)
{
scanf("%d", &x);
B[x] = 1;
}
//O(n*p*k*k) 会超时,当他可以看到所有的答案时,就不用DP了直接输出,复杂度降到 O(n(n/k)*(k*k)) = O(n*n*k);
if(p * k >= 2 * n)
{
int ans = 0;
for(int i = 1; i <= n; i++) if(A[i] | B[i]) ans++;
printf("%d\n", ans);
return 0;
}
//初始化及边界;
for(int i = 0; i < 2; i++) for(int j = 0; j <= p; j++) for(int a = 0; a <= k; a++) for(int b = 0; b <= k; b++) dp[i][j][a][b] = -INF;
dp[0][0][0][0] = 0;
for(int i = 1; i <= n; i++)
{ //初始化
int cur = i & 1, prev = 1 - cur;
for(int j = 0; j <= p; j++) for(int a = 0; a <= k; a++) for(int b = 0; b <= k; b++) dp[cur][j][a][b] = -INF;
//对于b为0的情况。
for(int j = 0; j < p; j++) upd(dp[cur][j + 1][k - 1][0], dp[prev][j][0][0] + A[i]);
for(int j = 0; j <= p; j++) for(int a = 0; a < k - 1; a++) upd(dp[cur][j][a][0], dp[prev][j][a + 1][0] + A[i]);
//对于a为0的情况。
for(int j = 0; j < p; j++) upd(dp[cur][j + 1][0][k - 1], dp[prev][j][0][0] + B[i]);
for(int j = 0; j <= p; j++) for(int b = 0; b < k - 1; b++) upd(dp[cur][j][0][b], dp[prev][j][0][b + 1] + B[i]);
//对于a和b都不为0的情况。
for(int j = 0; j <= p; j++) for(int a = 0; a < k - 1; a++) for(int b = 0; b < k - 1; b++) upd(dp[cur][j][a][b], dp[prev][j][a + 1][b + 1] + (A[i] | B[i]));
for(int j = 0; j < p; j++) for(int b = 0; b < k - 1; b++) upd(dp[cur][j + 1][k - 1][b], dp[prev][j][0][b + 1] + (A[i] | B[i]));
for(int j = 0; j < p; j++) for(int a = 0; a < k - 1; a++) upd(dp[cur][j + 1][a][k - 1], dp[prev][j][a + 1][0] + (A[i] | B[i]));
//对于a和b全为0的情况。
for(int j = 0; j <= p; j++) upd(dp[cur][j][0][0], dp[prev][j][0][0]);
}
int ans = -INF;
for(int j = 0; j <= p; j++) for(int a = 0; a <= k - 1; a++) for(int b = 0; b <= k - 1; b++) upd(ans, dp[n & 1][j][a][b]);
printf("%d\n", ans);
return 0;
}
815C(树形DP)
减枝
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 5e3 + 50;
int dp[maxn][maxn][2];
vector<int> dge[maxn];
int w1[maxn], w2[maxn], siz[maxn];
int ans = -1, n, b;
void dfs(int x) {
int len = dge[x].size();
siz[x] = 1;
dp[x][0][0] = 0;
dp[x][1][0] = w1[x];
dp[x][1][1] = w2[x];
for(int i = 0; i < len; i++) {
int y = dge[x][i]; dfs(y);
for(int j = siz[x]; j >= 0; j--) {
for(int k = siz[y]; k >= 0; k--) {
dp[x][j+k][1] = min(dp[x][j+k][1], min(dp[x][j][1] + dp[y][k][1], dp[x][j][1] + dp[y][k][0]));
dp[x][j+k][0] = min(dp[x][j+k][0], dp[x][j][0] + dp[y][k][0]);
}
}
siz[x]+=siz[y];
}
}
int main() {
// freopen("in.txt", "r", stdin);
int pre;
memset(dp, 0x3f3f3f3f, sizeof(dp));
scanf("%d%d", &n, &b); scanf("%d%d", &w1[1], &w2[1]); w2[1] = w1[1] - w2[1];
dge[0].push_back(1);
for(int i = 2; i <= n; i++) {
scanf("%d%d%d", &w1[i], &w2[i], &pre); w2[i] = w1[i] - w2[i];
dge[pre].push_back(i);
}
dfs(1);
for(int i = n; i >= 0; i--) {
if(dp[1][i][0] <= b || dp[1][i][1] <= b) {
printf("%d\n", i);
return 0;
}
}
printf("0\n");
return 0;
}