#DevStudy/문제풀이
[Baekjoon] 1932 - 숫자삼각형
검은_백조
2016. 10. 12. 12:58
https://www.acmicpc.net/problem/1932
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 | #include <stdio.h> #include <stdlib.h> #include <memory.h> #define MAX 501 int max(int a, int b) { return a > b ? a : b; } int main() { int count; int sum[MAX]; int prevSum[MAX]; int result = 0; scanf("%d\n", &count); // init memset(sum, 0, sizeof(int) * MAX); memset(prevSum, 0, sizeof(int) * MAX); for(int i = 1; i <= count; i++){ memcpy(prevSum, sum, sizeof(int) * MAX); for(int j = 1; j <= i; j++){ scanf("%d", &sum[j]); sum[j] += max(prevSum[j-1], prevSum[j]); result = max(result, sum[j]); } } printf("%d\n", result); return 1; } | cs |