Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // 벚꽃이 정보섬에 피어난 이유
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- #include <stdbool.h>
- #include <math.h>
- #include <limits.h>
- #define MAX 1001
- int main(){
- int N, Max = 0, tmp = 0;
- int arr[11] = {0,};
- int dp[11][11] = {0,};
- scanf("%d", &N);
- for( int i=1; i<=N; i++ ){
- scanf("%d", &arr[i]);
- dp[i][1] = arr[i];
- }
- for( int i=2; i<=N; i++ ){
- for( int j=1; j<=N-i+1; j++ ){
- dp[j][i] = dp[j][i-1]*arr[j+i-1];
- }
- }
- for( int i=1; i<=N-3; i++ ){
- for( int j=1; j<=N-3; j++ ){
- for( int k=1; k<=N-3; k++ ){
- for( int l=1; l<=N-3; l++ ){
- if( i + j + k + l == N ){
- tmp = dp[1][i] + dp[1+i][j] + dp[1+i+j][k] + dp[1+i+j+k][l];
- Max = Max>tmp?Max:tmp;
- }
- }
- }
- }
- }
- printf("%d", Max);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement