poj之旅——1083，1088，1125，1157，1163

一些比较简单的dp题，光看图就能猜到意思。

1125：

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n;
int f[110][110];
int main(){
	while (scanf("%d",&n)==1 && n){
		memset(f,0x3f,sizeof(f));
		for (int i=1;i<=n;i++){
			int m;
			scanf("%d",&m);
			for (int j=1;j<=m;j++){
				int x,y;
				scanf("%d%d",&x,&y);
				f[i][x]=y;
			}
			f[i][i]=0;
		}
		for (int k=1;k<=n;k++)
			for (int i=1;i<=n;i++)
				for (int j=1;j<=n;j++)
					if (f[i][k]+f[k][j]<f[i][j])
						f[i][j]=f[i][k]+f[k][j];
		int res=0x3f3f3f3f,choice;
		for (int i=1;i<=n;i++){
			int ans=0;
			for (int j=1;j<=n;j++)
				if (i!=j){
					ans=max(f[i][j],ans);
				}
			if (ans<res){
				res=ans;
				choice=i;
			}
		}
		printf("%d %d\n",choice,res);
	}
	return 0;
}

1083：

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int a[500];
int n;
int main(){
	int T;
	scanf("%d",&T);
	while (T--){
		scanf("%d",&n);
		for (int i=1;i<=n;i++){
			int x,y;
			scanf("%d%d",&x,&y);
			if (x>y)swap(x,y);
			if (!(x&1))x--;
			if (y&1)y++;
			for (int j=x;j<=y;j++)
				a[j]++;
		}
		int res=0;
		for (int i=1;i<=400;i++)
			if (res<a[i])res=a[i];
		printf("%d\n",res*10);
		memset(a,0,sizeof(a));
	}
	return 0;
}

1088；

#include<cstdio>
#include<algorithm>
using namespace std;
int direction[4][2]={
	{1,0},
	{0,1},
	{0,-1},
	{-1,0},
};
int n,m;
int f[110][110];
int h[110][110];
int dfs(int x,int y){
	if (f[x][y]>0)return f[x][y];
	for (int k=0;k<4;k++){
		int nx=x+direction[k][0];
		int ny=y+direction[k][1];
		if (nx<=0 || nx>n || ny<=0 || ny>m)continue;
		if (h[nx][ny]<h[x][y])f[x][y]=max(dfs(nx,ny)+1,f[x][y]);
	}
	return f[x][y];
}
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			scanf("%d",&h[i][j]);
	int ans=0;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
			if (dfs(i,j)>ans)ans=dfs(i,j);
	printf("%d",ans+1);
	return 0;
}

1157:

#include<cstdio>
#include<algorithm>
#include<cstring>
#define FOE(a,b,c) for (int (a)=(b);(a)<=(c);a++)
using namespace std;
const int M = 105;
int v[M][M], dp[M][M], b[M][M];
int n, m;
int main(){
    scanf("%d%d", &m, &n);
    FOE(i, 1, m) FOE(j, 1, n) scanf("%d", &v[i][j]);
    FOE(i, 1, m) dp[i][i-1] = -99999999;
    FOE(j, 1, n){
        int t = min(j, m);
        FOE(i, 1, t)dp[i][j] = max(dp[i][j-1],dp[i-1][j-1]+v[i][j]);
    }
    int ans = -1, t;
    for(int j = m; j<=n; j++)
        if(ans<dp[m][j])ans = dp[m][j];
    printf("%d\n", ans);
    return 0;
}

1163:

#include<cstdio>
#include<algorithm>
#define Int(a) scanf("%d",&(a))
#define REP(a,b,c) for (int (a)=(b);(a)<=(c);(a)++)
#define Put(a) printf("%d",(a))
#define Max(a,b) (a)=max((a),(b))
#define maxn 1100
#define Double maxn][maxn
using namespace std;
int n;
int a[Double];
int f[Double];
int main(){
	Int(n);
	REP(i,1,n)REP(j,1,i)Int(a[i][j]);
	f[1][1]=a[1][1];
	REP(i,1,n)REP(j,1,i)f[i][j]=max(f[i-1][j],f[i-1][j-1])+a[i][j];
	int ans=0;
	REP(i,1,n)Max(ans,f[n][i]);
	Put(ans);
	return 0;
}