【未知】P2331 [SCOI2005]最大子矩阵

#include<iostream>
#include<algorithm>
using namespace std;

int n, m, k;
int s1[101], s2[101], f[101][101][11];

int main()
{
    cin >> n >> m >> k;
    if (m == 1)
    {
        for (int i = 1; i <= n; i++)
        {
            int t;
            cin >> t;
            s1[i] = s1[i - 1] + t;
        }
        for (int h = 1; h <= k; h++)
        {
            for (int i = 1; i <= n; i++)
            {
                f[0][i][h] = f[0][i - 1][h];
                for (int j = 0; j < i; j++)
                    f[0][i][h] = max(f[0][i][h], f[0][j][h - 1] + s1[i] - s1[j]);
            }
        }
        cout << f[0][n][k];
        return 0;
    }
    for (int i = 1; i <= n; i++)
    {
        int t;
        cin >> t;
        s1[i] = s1[i - 1] + t;
        cin >> t;
        s2[i] = s2[i - 1] + t;
    }
    for (int h = 1; h <= k; h++)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                f[i][j][h] = max(f[i - 1][j][h], f[i][j - 1][h]);
                for (int x = 0; x < i; x++) f[i][j][h] = max(f[i][j][h], f[x][j][h - 1] + s1[i] - s1[x]);
                for (int x = 0; x < j; x++) f[i][j][h] = max(f[i][j][h], f[i][x][h - 1] + s2[j] - s2[x]);
                if (i == j)  for (int x = 0; x < i; x++) f[i][j][h] = max(f[i][j][h], f[x][x][h - 1] + s1[i] - s1[x] + s2[j] - s2[x]);
            }
        }
    }
    cout << f[n][n][k];
    return 0;
}