POJ 1163 The Triangle
来源:互联网 发布:软件行业 技术规范 编辑:程序博客网 时间:2024/05/01 17:18
The Triangle
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40354 Accepted: 24340
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
#include <stdio.h>int main(){int n;scanf("%d", &n);int i, j;int tr[105][105], max[105][105];for(i = 1; i <= n; i++)for(j = 1; j <=i; j++)scanf("%d", &tr[i][j]);for(i = n, j = 1; j <= i; j++)max[i][j] = tr[i][j];for(i = n; i >= 1; i--)for(j = 1; j <= i; j++){if(max[i][j] > max[i][j+1])max[i-1][j] = max[i][j] + tr[i-1][j];elsemax[i-1][j] = max[i][j+1] + tr[i-1][j];}printf("%d\n", max[1][1]);return 0;}
还不太懂什么是DP,别人的代码。
#include <stdio.h>#include <stdlib.h>#include <string.h>int max[105][105], tr[105][105];int n;int maxsum(int x, int y){if(x == n)return tr[x][y];if(max[x+1][y] == -1)max[x+1][y] = maxsum(x+1, y);if(max[x+1][y+1] == -1)max[x+1][y+1] = maxsum(x+1, y+1);if(max[x+1][y] > max[x+1][y+1])return max[x+1][y] + tr[x][y];elsereturn max[x+1][y+1] + tr[x][y];}int main(){int i, j;scanf("%d", &n);memset(max, -1, sizeof(max));for(i = 1; i <= n; i++)for(j = 1; j <= i; j++)scanf("%d", &tr[i][j]);printf("%d", maxsum(1,1));return 0;}
0 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
- Linux系统lseek函数作用
- 出自国外某牛人的一道面试题(About 42)
- 【Leetcode Algorithm】Remove Element
- c++ stl资源--qsort排序
- 【Leetcode Algorithm】Implement strStr()
- POJ 1163 The Triangle
- java学习07--运算符:三元运算符
- qtbase\\configure.exe' 不是内部或外部命令,也不是可运行的程序或批处理文件
- 求10000以内质数(以前都是直接打表,现在问到怎么求,瞬间词穷了,还是应该搞懂)
- 网狐定时器引擎分析
- <context:annotation-config/>有什么用
- available bandwidth paper(1)
- Spring 3.0 基于 Annotation 的依赖注入实现
- GDI总结