반복
2685 단어 귀속
F - Cow Bowling
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice POJ 3176
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:
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Then 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.
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 5
The highest score is achievable by traversing the cows as shown above.
제목:
N을 세는 것은 모두 몇 층이 있는지를 대표하고, 그 다음에 맨 위에서 맨 아래로 가서, 수를 합친 가장 큰 합을 구한다.
아이디어:
이것은 간단한 동적 기획 문제로 상태 이동 방정식 sum[i][j]=max {sum [i+1][j],sum[i+1][j+1]]]를 열거하고 상태 이동 방정식 sum[i][j]]==max {sum [i+1][j]], sum[i+1][j], sum[i+1], [j], sum[i+1][j+1][j+1][j+1][j+1][j+1][j+1][j+1] [j+1]jm[j+1] [jjjj+1] [ji+1] [jjji+1] [jjjjjjjj [[[[jjj] [[jjjj [[[[j] [j+1] [[jjjj 1], 마지막으로sum[1][1]을 출력하면 득수를 계산할 수 있다.
AC:
#include<stdio.h>
int main()
{
int a[400][400],sum[400][400];
int N,i,j;
scanf("%d",&N);
for(i=1;i<=N;i++)
for(j=1;j<=i;j++)
scanf("%d",&a[i][j]);
for(i=1;i<=N;i++)
sum[N][i]=a[N][i];
for(i=N-1;i>=0;i--)
for(j=1;j<=N;j++)
sum[i][j]+=(sum[i+1][j]>sum[i+1][j+1]?sum[i+1][j]:sum[i+1][j+1])+a[i][j];
printf("%d
",sum[1][1]);
}
요약:
이것은 며칠 전에 이미 풀었던 문제이니 오늘 다시 완전하게 한 번 써서 복습으로 삼아라.