P1650 田忌赛马

原题链接
贪心优化dp决策集合
设f[i,j]表示齐王按从强到弱的顺序出马和田忌进行了i场比赛之后，从“头”取了j匹较强的马，从“尾”取了i-j匹较弱的马，所能够得到的最大盈利。
状态转移方程如下：
F[i,j]=max{f[i-1,j]+c[n-(i-j)+1,i],f[i-1,j-1]+c[j,i]}
代码如下：

#include <bits/stdc++.h>

using namespace std;

inline int read() {
	int x = 0, f = 0; char ch = getchar();
	while (!isdigit(ch)) f = ch == '-', ch = getchar();
	while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

const int N = 2010;
int n, a[N], b[N], c[N][N], f[N][N]; 

bool cmp(int x, int y) { return x > y; }

int main() {
	n = read(); 
	for (int i = 1; i <= n; ++i) a[i] = read(); 
	for (int i = 1; i <= n; ++i) b[i] = read(); 
	sort(a + 1, a + n + 1, cmp); sort(b + 1, b + n + 1, cmp); 
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (a[i] > b[j]) c[i][j] = 200; 
			else if (a[i] == b[j]) c[i][j] = 0; 
			else c[i][j] = -200; 
			f[i][j] = -1e8;
		}
	}
	for (int i = 1; i <= n; ++i) {
		f[i][0] = f[i - 1][0] + c[n + 1 - i][i]; 
		f[i][i] = f[i - 1][i - 1] + c[i][i];  
		for (int j = 1; j < i; ++j) {
			f[i][j] = max(f[i - 1][j] + c[n + 1 - i + j][i], f[i - 1][j - 1] + c[j][i]); 
		}
	}
	int ans = -1e8; 
	for (int j = 0; j <= n; ++j) ans = max(ans, f[n][j]); 
	printf("%d\n", ans); 
	return 0; 
}