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 | #include <cstdio>using namespace std;int m(int a, int b) {return a>=b ? a:b;}int main(){ for(int T=0;T<10; ) { scanf("%d", &T); int arr[100][100]; int max=0; int sum1,sum2; for(int i=0; i<100; i++) { sum1=0; for(int j=0; j<100; j++) {scanf("%d",&arr[i][j]);sum1+=arr[i][j];} if(max<sum1) max=sum1; } for(int i=0; i<100; i++) { sum1=0; for(int j=0; j<100; j++) sum1+=arr[j][i]; if(max<sum1) max=sum1; } sum1=0; sum2=0; for(int i=0; i<100; i++) { sum1+=arr[i][i]; sum2+=arr[i][99-i]; if(max<m(sum1,sum2)) max=m(sum1,sum2); } printf("#%d %d\n", T, max); }} |
'알고리즘 문제 풀이 > 1DP_과제(~180615)' 카테고리의 다른 글
| 171101_회문1 (0) | 2017.11.01 |
|---|---|
| 171031_string (0) | 2017.10.31 |
| 171030_flatten (0) | 2017.10.30 |
| 171030_view (0) | 2017.10.30 |
| 171030_간단한 369 게임 (0) | 2017.10.30 |