K. AEMShana loves games!
题目传送门:
题目传送门!
题面:
题目大意:
代码:
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int maxn = 1e6 + 10;
const int MAX = 1e5 + 9;
struct Node {
int t;
int p;
int k;
} node[maxn];
int dp[MAX][21];
int dpp[MAX][21];
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
while (cin >> n) {
memset(dp, 0, sizeof(dp));
memset(dpp, 0, sizeof(dpp));
int tt = 0;
for (int i = 1; i <= n; i++) {
cin >> node[i].t >> node[i].p >> node[i].k;
if (tt < node[i].t) tt = node[i].t;
if (!node[i].k)dp[node[i].t][node[i].p] += 1;
else dp[node[i].t][node[i].p] -= 1;
}
for (int i = 1; i <= tt; i++) {
for (int j = 0; j < 11; j++) {
int tmp = abs(j - 5);
if (tmp <= i) {
dpp[i][j] = dpp[i - 1][j];
if (j && abs(j - 1 - 5) <= i)
dpp[i][j] = max(dpp[i][j], dpp[i - 1][j - 1]);
if (j < 10 && abs(j + 1 - 5) <= i)
dpp[i][j] = max(dpp[i][j], dpp[i - 1][j + 1]);
dpp[i][j] += dp[i][j];;
} else dpp[i][j] = -INF;
}
}
int ans = -INF;
for (int i = 0; i < 11; i++)
if (abs(i - 5) <= tt)
ans = max(ans, dpp[tt][i]);
cout << ans << endl;
}
}