poj 1163 The Triangle
2016-07-23 10:02
465 查看
The Triangle
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 44961 Accepted: 27147
Description
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
(Figure 1)
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.
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
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
方法1:记忆性递归程序
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 110;
int a[maxn][maxn];
int maxsum[maxn][maxn];
int n;
int solve(int i,int j)
{
if(maxsum[i][j]!=-1)
return maxsum[i][j];
if(i==n){
return a[i][j];
}else{
maxsum[i][j] = max(solve(i+1,j),solve(i+1,j+1))+a[i][j];
return maxsum[i][j];
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
scanf("%d",&a[i][j]);
maxsum[i][j] = -1;
}
}
printf("%d\n",solve(1,1));
return 0;
}
方法二:“人人为我”递推型动归程序
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
//“人人为我”空间优化版递推型动归
const int maxn = 110;
int a[maxn][maxn];
int n;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++)
scanf("%d",&a[i][j]);
}
for(int i=n-1;i>=1;--i){
for(int j=1;j<=i;++j){
a[i][j] = a[i][j]+max(a[i+1][j],a[i+1][j+1]);
}
}
printf("%d\n",a[1][1]);
return 0;
}
此外还可以加上滚动数组来进行空间优化。
相关文章推荐
- laravel linux composer.phar
- redis 命令
- poj 1751 (最小生成树 Prime+kruskal 路径输出)
- 【笔记】PMBOK第6章项目进度管理
- Cordova
- wamp集成环境下帝国备份出错
- 查询锁 闭区间与开区间
- 知道这些,才能搞定线下活动直播
- css常用属性(续)
- Android Studio导入项目gradle报错,解决方案
- 1077. Kuchiguse (20)
- 微信公众平台个性化菜单的建立
- Python案例-网络编程-进程池
- 【POJ】-2356-Find a multiple(抽屉原理&STL)
- Android--日期对话框和时间对话框
- hdu2031-进制转换问题 vector容器
- PHP IDE phpstorm 常用快捷键
- Educational Codeforces Round 14 A. Fashion in Berland 水题
- 算法基础知识科普:8大搜索算法之二分搜索
- JavaSE基础(五)