nyoj 18 The Triangle 【经典dp】
来源:互联网 发布:淘宝店铺地址哪里看 编辑:程序博客网 时间:2024/05/21 11:23
The Triangle
时间限制:1000 ms | 内存限制:65535 KB
难度:4
- 描述
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.- 输入
- 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.
- 输出
- Your program is to write to standard output. The highest sum is written as an integer.
- 样例输入
573 88 1 0 2 7 4 44 5 2 6 5
- 样例输出
30
数塔模型:
#include<stdio.h>#include<string.h>#include<stdlib.h>int max(int x,int y){ return x>y?x:y;}int dp[110][110];int main(){ int n,m,i,j; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { scanf("%d",&dp[i][j]); } } for(i=n-1;i>=1;i--) { for(j=1;j<=i;j++) { dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]); } } printf("%d\n",dp[1][1]); } return 0;}
0 0
- nyoj 18 The Triangle 【经典dp】
- NYOJ - The Triangle(经典dp)
- NYOJ题目18-The Triangle(经典dp)
- NYOJ 18 The Triangle(简单dp)
- nyoj The Triangle 18 (简单DP)
- nyoj--18--The Triangle(dp水题)
- NYOJ 18-The Triangle(典型DP)
- The Triangle 经典DP
- The Triangle 经典DP
- NYOJ 18 The Triangle
- NYOJ 18-The Triangle
- The Triangle(nyoj 18)
- nyoj-18-The Triangle
- NYOJ-18 The Triangle
- NYOJ 18 The Triangle
- The Triangle--nyoj 18
- nyoj 18The Triangle
- NYOJ 18 The Triangle
- java解惑--灰色的影子
- p122.14
- 学习笔记
- 不用AuxDIBImageLoad()向opengl中载入bmp纹理
- ClassLoader介绍及ClassLoader.loadClass和Class.forName()的比较
- nyoj 18 The Triangle 【经典dp】
- Majority Element
- 双系统(win8.1+ubuntu14.04)删除win下分区导致grub rescue解决方案
- 给N条边,请找三条边,使其组成一个三角形,并使得这个三角形的周长最大。
- 可微与连续
- 【C++】用函数模板实现不同类型的两个数比较大小
- substr截取字符串
- hdu Exploration (并查集 拓扑 强连通)
- 在Android开发中,有哪些好的内存优化方式?