pku 1157 LITTLE SHOP OF FLOWERS 水货dp 解题报告
来源:互联网 发布:mac能用ps吗 编辑:程序博客网 时间:2024/05/01 19:17
pku 1157 LITTLE SHOP OF FLOWERS 解题报告
算法:很直观的dp,不多说。
AC代码:
#include <stdio.h>
#include <string.h>
#define inf -55
#define max(a, b) (a > b ? a : b)
int F, V, A[105][105], dp[105][105];
int main()
{
freopen("flower10.inp", "r", stdin);
int i, j, k;
scanf("%d%d", &F, &V);
for (i = 0; i < F; i++)
{
for (j = 0; j < V; j++)
{
scanf("%d", &A[i][j]);
}
}
for (i = 0; i < V; i++)
{
dp[0][i] = A[0][i];
}
for (i = 1; i < F; i++)
{
for (j = 0; j < V; j++)
{
dp[i][j] = inf;
}
}
for (i = 1; i < F; i++)
{
for (j = i - 1; j < V; j++)
{
for (k = j + 1; k < V; k++)
{
dp[i][k] = max(A[i][k] + dp[i - 1][j], dp[i][k]);
}
}
}
int answer = inf;
for (i = 0; i < V; i++)
{
if (dp[F - 1][i] > answer)
{
answer = dp[F - 1][i];
}
}
printf("%d/n", answer);
return 0;
}
- pku 1157 LITTLE SHOP OF FLOWERS 水货dp 解题报告
- Pku acm 1157 LITTLE SHOP OF FLOWERS 动态规划题目解题报告(十四)
- POJ - 1157 LITTLE SHOP OF FLOWERS解题报告
- PKU 1157 LITTLE SHOP OF FLOWERS
- POJ 1157 LITTLE SHOP OF FLOWERS (DP)
- POJ 1157 LITTLE SHOP OF FLOWERS ( DP )
- POJ 1157-LITTLE SHOP OF FLOWERS(DP)
- poj 1157 LITTLE SHOP OF FLOWERS dp
- poj 1157 LITTLE SHOP OF FLOWERS(DP)
- 【DP】POJ-1157 LITTLE SHOP OF FLOWERS
- POJ 1157 LITTLE SHOP OF FLOWERS(DP)
- poj 1157 LITTLE SHOP OF FLOWERS DP 背包问题变形
- poj 1157 LITTLE SHOP OF FLOWERS 【简单DP】
- poj 1157 LITTLE SHOP OF FLOWERS(DP)
- POJ 1157 LITTLE SHOP OF FLOWERS 水DP
- POJ 1157 LITTLE SHOP OF FLOWERS (线性dp)
- POJ 1157/SGU104 Little shop of flowers(DP)
- POJ 1157 Little shop of flowers(DP,最优搭配)
- 艾宾浩斯记忆曲线
- 网站收藏
- flash上传网站大全
- 哪个杀毒软件最好?
- Asp.Net 发送 smpt邮件
- pku 1157 LITTLE SHOP OF FLOWERS 水货dp 解题报告
- 标准
- 笔记本显卡性能
- asp.net 一点一滴(持续更新中......)
- 读书笔记——《UNIX环境高级编程》第七章_ 进程环境
- windows到Linux代码移植
- java学习之路5---java为菜单栏添加快捷键(转)
- 黑莓关于SMS的监听的补充
- 编译android源代码的一些错误处理