POJ 1163 The Triangle
来源:互联网 发布:湖南纳米娱乐网络 编辑:程序博客网 时间:2024/06/07 11:23
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.
I put this in my blog is to remind me why am I getting start and always keeping forward.This simple dp question is one of the basic question of dynamic programming.when evaluated the formula I use loop to calculate the array.
#include <iostream>#include<map>#include<vector>#include<cstring>#include<algorithm>#include<cmath>#include<queue>using namespace std;int t[105][105];int d[105][105];int main(){ memset(d,0,sizeof(d)); memset(t,0,sizeof(t)); int n=0; cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) { cin>>t[i][j]; } } d[1][1]=t[1][1];d[2][1]=t[2][1]+d[1][1];d[2][2]=t[2][2]+d[1][1]; for(int i=3;i<=n;i++) { for(int j=1;j<=i;j++) { d[i][j]=max(d[i-1][j-1],d[i-1][j])+t[i][j]; } } int ans=0; for(int i=1;i<=n;i++) { ans=max(ans,d[n][i]); } cout<<ans<<endl; return 0;}
- The Triangle--poj--1163
- POJ 1163 The Triangle
- poj 1163 The Triangle
- Poj 1163 The Triangle
- poj 1163 The Triangle
- poj 1163 The Triangle
- poj 1163 The Triangle
- POJ 1163 The Triangle
- poj 1163 The Triangle
- POJ 1163 The Triangle
- POJ 1163 The Triangle
- poj 1163 The Triangle
- poj-1163 The Triangle
- poj 1163 The Triangle
- POJ-1163-The Triangle
- poj 1163 The Triangle
- POJ-1163-The Triangle
- poj 1163 The Triangle
- C++引用形参+模板---解决数组指针退化为指针
- SQL SERVER分区具体例子详解
- matlab str2double与str2num
- 夕拾算法进阶篇:12)出栈序列统计(动态规划DP)
- javascript正则表达式(1)——RegExp对象与常用字符
- POJ 1163 The Triangle
- matlab 一条语句跨越多行
- Android 6.0 for X86
- 《UVM实战》,一个简单实例的源代码理解
- 有道云笔记学习Markdown命令
- 用matlab处理数字高程模型(DEM)之点云数据(point cloud data)
- 手写简单的图片加载框架
- SQL SERVER分区具体例子详解_0
- happens-before俗解