poj 3176 Cow Bowling
2012-02-26 11:16
190 查看
求最大的路径数之和
#include <iostream>
#include <string.h>
using namespace std;
#define maxnum 355
#define max(a,b) (a)>=(b)? (a):(b)
int map[maxnum][maxnum];
int n;
int main()
{
int i,j;
while(cin>>n)
{
if(n==0) break;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
cin>>map[i][j];
for(i=n;i>1;i--)
{
for(j=1;j<i;j++)
{
map[i-1][j]=max(map[i-1][j]+map[i][j],map[i-1][j]+map[i][j+1]);
}
}
cout<<map[1][1]<<endl;
}
return 0;
}
#include <iostream>
#include <string.h>
using namespace std;
#define maxnum 355
#define max(a,b) (a)>=(b)? (a):(b)
int map[maxnum][maxnum];
int n;
int main()
{
int i,j;
while(cin>>n)
{
if(n==0) break;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
cin>>map[i][j];
for(i=n;i>1;i--)
{
for(j=1;j<i;j++)
{
map[i-1][j]=max(map[i-1][j]+map[i][j],map[i-1][j]+map[i][j+1]);
}
}
cout<<map[1][1]<<endl;
}
return 0;
}
相关文章推荐
- POJ 3176 Cow Bowling 动态规划
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- Poj 3176 Cow Bowling
- poj_3176Cow Bowling问题(已解决)
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling (简单dp——数塔问题)
- poj 3176 Cow Bowling 【数塔】
- POJ-3176-Cow Bowling
- POJ 3176-Cow Bowling(dp_数字三角形)
- poj-3176-Cow Bowling
- POJ 3176 Cow Bowling
- POJ-3176-Cow Bowling
- 【POJ】[3176]Cow Bowling
- POJ 3176:Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- 【poj 3176】Cow Bowling 题意&题解&代码(C++)
- POJ 3176 Cow Bowling