ow Bowling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 12423 | Accepted: 8189 |
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
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
Sample Output
30
Hint
Explanation of the sample:
7 * 3 8 * 8 1 0 * 2 7 4 4 * 4 5 2 6 5The highest score is achievable by traversing the cows as shown above.
Source
非常简单的杨辉三角。
只需要写一个函数来计算line行第n个元素的index是多少,就可以。
dp时直接去max上一行对应的两个位置就可以。
/*Source Code
Problem: 3176 User: 775700879
Memory: 936K Time: 344MS
Language: G++ Result: Accepted
Source Code */
#include
#include
#include
#include
#include
#define oo 0x3f3f3f3f using namespace std; int dp[70000]; int c= 1; //void getline(int index, int & line, int & num) { // for (line = 1; line <= 350; line++) { // if ((1+line)*line/2 > index) break; // } // num = line - (line * (line + 1) / 2 - index); //} int getindex(int line, int num) { int result = line * (line + 1) / 2; return result - (line - num); } int main() { int n; int i, j; int num; cin >> n; int num1, num2; for (i = 1; i <= n; i++) { for (j = 1; j <= i; j++) { cin >> num; if (i == 1) dp[c] = num; else { if (j != i) { num1 = getindex(i - 1, j); dp[c] = max(dp[c], dp[num1] + num); } if (j != 1) { num1 = getindex(i - 1, j - 1); dp[c] = max(dp[c], dp[num1] + num); } } c++; } } c--; int imax = 0; for (i = 1; i <= n; i++) { if (dp[c] > imax) imax = dp[c]; c--; } cout << imax << endl; }