poj 3176 Cow Bowling
来源:互联网 发布:造价工程师考试软件 编辑:程序博客网 时间:2024/06/10 09:20
Cow Bowling
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13481 Accepted: 8909
Description
The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:
Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5Then the other cows traverse the triangle starting from its tip and moving "down" to one of the two diagonally adjacent cows until the "bottom" row is reached. The cow's score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame.
Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.
Input
Line 1: A single integer, N
Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle.
Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle.
Output
Line 1: The largest sum achievable using the traversal rules
Sample Input
573 88 1 02 7 4 44 5 2 6 5
Sample Output
30
#include<stdio.h>int max(int x,int y){return (x>y?x:y);}int main (){ int n; int i,j,dp[1000][1000]; scanf("%d",&n); 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]=dp[i][j]+max(dp[i+1][j],dp[i+1][j+1]); } printf("%d\n",dp[1][1]); return 0;}
0 0
- POJ 3176 COW BOWLING
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- Poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 cow bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- poj 3176 Cow Bowling
- POJ 3176 Cow Bowling
- poj 3176 Cow Bowling
- iOS 百度云推送详解
- Android Activity 常用功能设置(全屏、横竖屏等)
- QLineEdit设置ip输入规则
- ActiveMQ学习笔记02 - 多服务器间的通信
- 一个DIV+CSS代码布局的简单导航条
- poj 3176 Cow Bowling
- [c.y.j]linux获取当前时间
- 计算机网络复习选择题练习题
- 强大的任务管理器-Process Hacker
- Lua文档
- IM------XMPP协议
- IntelliJ IDEA 问题总结之二(待补充) —— 快捷键、主题样式、导出jar、sqlite
- Python_cmd的各种实现方法及优劣(subprocess.Popen, os.system和commands.getstatusoutput)
- oracle统计字符串中某个字符出现的次数详解