구간차의 합 문서 더블릿

#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
int arr[200] = { 0 };
int dp[200][200] = { 0 };
int num[200][200] = { 0 };
int cut[200][200][100] = { 0 };
 
int main() {
    int n;
    scanf("%d", &n);
    getchar();
 
    for (int i = 1; i <= n; i++) {
        scanf("%d", &arr[i]);        
    }
    
 
    for (int len = 1; len < n; len++) {        
        for (int i = 1; i < n; i++) {
            int maxNum = 0, minNum = 1000;
            if (i + len <= n) {
                for (int j = i; j <= i + len; j++) {
                    if (maxNum < arr[j]) {
                        maxNum = arr[j];
                    }
                    if (minNum > arr[j]) {
                        minNum = arr[j];
                    }
                }
                int diff = maxNum - minNum;
 
                int tmp = 0;
                for (int j = i + 1; j <= i + len-1; j++) {                    
                    if (tmp < dp[i][j] + dp[j + 1][i + len]) {
                        num[i][i + len] = num[i][j] + num[j + 1][i + len];                        
                    }
                    tmp = max(tmp, dp[i][j] + dp[j + 1][i + len]);
                }
 
                if (diff > tmp) {
                    num[i][i + len] = 1;
                }
                dp[i][i + len] = max(diff, tmp);
                printf("%d %d\n", diff, tmp);
            }
        }
    }
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            printf("%d ", dp[i][j]);
        }
        printf("\n");
    }
 
    printf("%d %d", dp[1][n],num[1][n]);
}