POJ 1163 The Triangle
来源:互联网 发布:js格式化时间 format 编辑:程序博客网 时间:2024/06/07 18:22
The Triangle
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47093 Accepted: 28499
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
Source
IOI 1994
一道简单的动态规划题目,状态转移方程为:dp[i][j] = max(dp[i - 1][j], dp[i-1][j-1])+a[i][j];
#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;int a[105][105],dp[105][105];int main(){int n;while(~scanf("%d",&n)){memset(a,0,sizeof(a));memset(dp,0,sizeof(dp));for(int i = 1; i <= n; i ++){for(int j = 1; j <= i; j ++)scanf("%d",&a[i][j]);}for(int i = 1; i <= n; i ++){for(int j = 1; j <= i; j ++){dp[i][j] = max(dp[i - 1][j],dp[i - 1][j - 1]) + a[i][j];}}int Max = 0;for(int i = 1; i <= n; i ++)Max = max(Max,dp[n][i]);printf("%d\n",Max);}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
- 威佐夫博弈
- CODE[vs] 天梯 1501 二叉树最大宽度和高度
- 前端PS基础
- 1016: 守望者的逃离
- 《深入理解java虚拟机》-java内存模型与线程
- POJ 1163 The Triangle
- Oracle创建表空间
- Http Server : 一个差生的逆袭
- 系统管理之Systemd详解(centos7)
- 1021: 多项式系数
- Unity 之欧拉角 pitch yaw roll
- HTML的基本概念
- POJ_1426 FIND THE MULITIPLE [数字dfs]
- Access2016学习4