求助不能用INT32_MAX，能用0x3f3f3f3f的原因

#include <bits/stdc++.h>
using namespace std;

const int INF = 0x3f3f3f3f;

int val[10][10] = {0};
int dp[20][10][10][10][10] = {0}; // n i j k l

int get_val_sq(int i, int j, int k, int l) {
    int x = val[k][l] - val[k][j - 1] - val[i - 1][l] + val[i - 1][j - 1];
    return x * x;
}

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= 8; i++) {
        for (int j = 1; j <= 8; j++) {
            cin >> val[i][j];
            val[i][j] += val[i - 1][j] + val[i][j - 1] - val[i - 1][j - 1];
        }
    }
    for (int i = 1; i <= 8; i++) {
        for (int j = 1; j <= 8; j++) {
            for (int k = i; k <= 8; k++) {
                for (int l = j; l <= 8; l++) {
                    // initialize
                    dp[1][i][j][k][l] = get_val_sq(i, j, k, l);
                }
            }
        }
    }
    for (int t = 2; t <= n; t++) {
        for (int i = 1; i <= 8; i++) {
            for (int j = 1; j <= 8; j++) {
                for (int k = i; k <= 8; k++) {
                    for (int l = j; l <= 8; l++) {
                        int ans = INF;
                        // cut in line
                        for (int c = j; c < l; c++) {
                            int val1 = dp[1][i][j][k][c] + dp[t - 1][i][c + 1][k][l];
                            int val2 = dp[t - 1][i][j][k][c] + dp[1][i][c + 1][k][l];
                            ans = min(ans, min(val1, val2));
                        }
                        // cut in row
                        for (int c = i; c < k; c++) {
                            int val1 = dp[1][i][j][c][l] + dp[t - 1][c + 1][j][k][l];
                            int val2 = dp[t - 1][i][j][c][l] + dp[1][c + 1][j][k][l];
                            ans = min(ans, min(val1, val2));
                        }
                        dp[t][i][j][k][l] = ans;
                    }
                }
            }
        }
    }
    cout << dp[n][1][1][8][8] << endl;
    return 0;
}