poj 1163 The Triangle
2011-08-18 10:33
225 查看
/* 入门级dp dp必做 */ #define LOCAL #include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<cstdlib> #include<iomanip> #include<string> #include<algorithm> #include<ctime> #include<stack> #include<queue> #include<vector> #define N 105 using namespace std; int dp ,a ; int main() { #ifdef LOCAL freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); #endif int i,j,len,max; memset(dp,0,sizeof(dp)); memset(a,0,sizeof(a)); cin>>len; for(i=1;i<=len;i++) for(j=1;j<=i;j++) cin>>a[i][j]; for(i=1;i<=len;i++) { for(j=1;j<=i;j++) { if(j==1){dp[i][j]=dp[i-1][j]+a[i][j];} else if(i==j){dp[i][j]=dp[i-1][j-1]+a[i][j];} else dp[i][j]=a[i][j]+(dp[i-1][j]>dp[i-1][j-1]?dp[i-1][j]:dp[i-1][j-1]); } } max=dp[len][1]; for(i=2;i<=len;i++) if(max<dp[len][i]) max=dp[len][i]; cout<<max<<endl; return 0; }
相关文章推荐
- POJ-1163-The Triangle
- POJ-1163-The Triangle
- poj 1163 The Triangle(DP水水 = =第二次写!)
- POJ1163 The Triangle【DFS】
- POJ 1163 The Triangle
- POJ 1163 The Triangle
- POJ 1163 The Triangle
- 动态规划入门-POJ 1163-The Triangle(数字三角形)
- DP专题1 POJ 1163 The Triangle
- POJ 1163 The Triangle【dp+杨辉三角加强版(递归)】
- POJ_1163_The triangle
- The Triangle - POJ 1163 水题
- POJ 1163 The Triangle
- poj 1163 The Triangle
- POJ 1163 The Triangle
- POJ-1163-The Triangle
- POJ 1163 The Triangle
- poj 1163 The Triangle
- POJ 3176-Cow Bowling/POJ 1163-The Triangle(简单DP-数塔)
- poj1163 The Triangle ——DP入门题