POJ1157 LITTLE SHOP OF FLOWERS
来源:互联网 发布:快鱼服饰网络专卖店 编辑:程序博客网 时间:2024/04/30 16:22
#include<iostream>
using namespace std;
#define MAX 120
int map[MAX][MAX];
int f[MAX][MAX];
int n,m;
int main()
{
int i,j,k;
int max;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&map[i][j]);
memset(f,0,sizeof(f));
for(i=1;i<=m;i++)
f[1][i]=map[1][i];
for(i=2;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(j>=i)
{
for(k=1;k<j;k++)
{
if(map[i][j]+f[i-1][k]>f[i][j])
f[i][j]=map[i][j]+f[i-1][k];
}
}
}
}
max=-999999;
for(j=1;j<=m;j++)
if(f[n][j]>max)
max=f[n][j];
printf("%d/n",max);
// system("pause");
return 0;
}
- POJ1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS
- poj1157 - LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS (dp)
- POJ1157 LITTLE SHOP OF FLOWERS DP
- POJ1157——LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS DP
- [背包]poj1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS-dp
- poj1157 LITTLE SHOP OF FLOWERS(dp)
- POJ1157 LITTLE SHOP OF FLOWERS题解动态规划DP
- 【POJ1157】LITTLE SHOP OF FLOWERS (简单动态规划)
- POJ1157 LITTLE SHOP OF FLOWERS(动态规划DP)
- 开博
- IT人 不要一辈子靠技术生存
- uVision显示成“礦ision”的解决办法
- mysql data too long for column 解决方案
- DataGridView分页及分页后页面操作(上页、下页、页面跳转)类
- POJ1157 LITTLE SHOP OF FLOWERS
- 无题
- 垃圾回收的算法
- 希望可以多从那些网络牛人学些东西,改变自己~
- 我的分页代码
- PDU格式
- JavaScript DOM编程艺术读书笔记及实用方法和函数总结
- UltraEdit中的正则表达式
- Head First C# 中文版 第九章 读写文件 page404