BZOJ3997 Dilworth定理

题目：(http://www.lydsy.com/JudgeOnline/problem.php?id=3997)

Dilworth定理：DAG的最小链覆盖=最大点独立集
原题便可转为求最大点集且集合中任意两点不可到达（即左下-右上关系）
DP求解

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n,m,a[1003][1003],T;
long long f[1003][1003];
inline int read()
{
    char ch;
    while (ch=getchar(),ch<'0'||ch>'9');
    int r=ch-'0';
    while (ch=getchar(),ch>='0'&&ch<='9') r=r*10-'0'+ch;
    return r; 
}
int main()
{
    scanf("%d",&T);
    while (T--) {
        n=read(); m=read();
        for (int i=1;i<=n;++i)
            for (int j=1;j<=m;++j) a[i][j]=read(); 
        for (int i=n;i;--i)
            for (int j=1;j<=m;++j)
                f[i][j]=max(f[i][j-1],max(f[i+1][j],f[i+1][j-1]+a[i][j]));
        printf("%lld\n",f[1][m]);
    }
}