POJ1163:The Triangle
来源:互联网 发布:java访问nas存储空间 编辑:程序博客网 时间:2024/05/29 13:00
Description
73 88 1 02 7 4 44 5 2 6 5(Figure 1)
Input
Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
573 88 1 0 2 7 4 44 5 2 6 5
Sample Output
30
第一道DP题
#include<iostream>#include<cstdio>#include <string.h>#include<algorithm>using namespace std;const int maxn=102;int f[maxn][maxn];int a[maxn][maxn];int main(){ int n,i,j; while(scanf("%d",&n)!=EOF) { for(i=1; i<=n; ++i) for(j=1; j<=i; ++j) scanf("%d",&a[i][j]); memset(f,0,sizeof(f)); for(i=1; i<=n; ++i) { for(j=1; j<=i; ++j) { if(i == 1) f[i][j] = a[i][j]; else if(j == 1) f[i][j] = f[i-1][j] + a[i][j]; else if(j == i) f[i][j] = f[i-1][j-1] + a[i][j]; else f[i][j] = max(f[i-1][j],f[i-1][j-1]) + a[i][j]; } } int ans = 0; for(i = 1;i<n;i++) ans = max(ans,f[n][i]); cout << ans << endl; } return 0;}
- POJ1163 The Triangle
- POJ1163:The Triangle
- POJ1163 The Triangle
- POJ1163 The Triangle 【DP】
- POJ1163 The Triangle
- POJ1163 The Triangle
- POJ1163 The Triangle
- POJ1163 The Triangle
- poj1163 the triangle 题解
- POJ1163 The Triangle
- POJ1163 The Triangle 题解
- POJ1163 The Triangle
- poj1163 dp the triangle
- POJ1163 The Triangle
- poj1163 The Triangle
- poj1163 The Triangle
- The Triangle(poj1163)
- POJ1163 The Triangle【DFS】
- 阿里巴巴离职DBA 35岁总结的职业生涯
- objective-c 引用第三方lib的扩展方法
- Shell脚本编程读书笔记
- android binder 讲解之权限管理
- android:shape的使用
- POJ1163:The Triangle
- 学习感悟之蕃茄工作法
- 冒泡排序
- 关于Android中权重问题
- SVM的多类分类的实现
- 华为模拟环境工具[ENSP内部专用]
- [OpenCV] -- win7下配置OpenCV的Qt开发环境
- 锁屏界面永远不出现 取消自动关屏和休眠
- Cannot cast from View to CheckBox