UVA - 10564 Paths through the Hourglass

简单的dp，特殊的地方稍加处理下就行了，很多考编程能力的细节要注意。注意结果可能很大，要用long long ,另外vim用着还是可以的

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#define MAXN 25
#define MAXM 510
using namespace std;

int n,s,ss[MAXN*2][MAXN];
long long dp[MAXN*2][MAXN][MAXM];

void print(int line,int indext,int s){
//<F9>	cout<<"a"<<line<<" "<<indext<<" "<<s<<endl;
	if(line<n){
		if(indext-1>=0&&dp[line+1][indext-1][s-ss[line][indext]]>0){
			cout<<"L";
			print(line+1,indext-1,s-ss[line][indext]);
		}
		else if(dp[line+1][indext][s-ss[line][indext]]>0){
			cout<<"R";
			print(line+1,indext,s-ss[line][indext]);
		}
	}
	else if(line<2*n-1){
		if(dp[line+1][indext][s-ss[line][indext]]>0){
			cout<<"L";
			print(line+1,indext,s-ss[line][indext]);
		}
		else if(dp[line+1][indext+1][s-ss[line][indext]]>0){
			cout<<"R";
			print(line+1,indext+1,s-ss[line][indext]);
		}
	}
}

int main(){
	while(cin>>n>>s&&(n+s)){
		memset(dp,0,sizeof(dp));
		for(int i=1;i<2*n;i++){
			for(int j=0;j<=abs(n-i);j++){
				cin>>ss[i][j];	
			}
		}
		for(int i=0;i<n;i++)
			dp[2*n-1][i][ss[2*n-1][i]]=1;
		for(int i=2*n-2;i>=1;i--){
			for(int j=0;j<=abs(n-i);j++){
				for(int t=0;t<=s;t++){
					if(i<n){
						if(t-ss[i][j]>=0&&j-1>=0&&dp[i+1][j-1][t-ss[i][j]]>0)
								dp[i][j][t]+=dp[i+1][j-1][t-ss[i][j]];
						if(t-ss[i][j]>=0&&dp[i+1][j][t-ss[i][j]]>0)
								dp[i][j][t]+=dp[i+1][j][t-ss[i][j]];
					}
					else{
						if(t-ss[i][j]>=0&&dp[i+1][j+1][t-ss[i][j]]>0)
								dp[i][j][t]+=dp[i+1][j+1][t-ss[i][j]];
						if(t-ss[i][j]>=0&&dp[i+1][j][t-ss[i][j]]>0)
								dp[i][j][t]+=dp[i+1][j][t-ss[i][j]];						
					}
				}
			}
		}
		long long ans=0,indext;
		for(int i=n-1;i>=0;i--){
			if(dp[1][i][s]>0){
				ans+=dp[1][i][s];
				indext=i;
			}
		}
		cout<<ans<<endl;
		if(ans==0){
			cout<<endl;
		}
		else{
			cout<<indext<<" ";
			print(1,indext,s);
			cout<<endl;
		}
	}
	return 0;
}