luogu2258

题面

sol：先爆搜搜出r行，再在那r行中选c列DP得到最优解

我太菜了，这种题都做了好久，还需锻炼码力啊qwq

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n, m, r, c, Map[][], loc[], ll[], hh[][], f[][], ans;
inline void solve()
{
    memset(f, , sizeof f);
    memset(ll, , sizeof ll);
    memset(hh, , sizeof hh);
    for(int i = ; i <= m; i++)
    for(int j = ; j <= r; j++)
    ll[i] += abs(Map[loc[j]][i] - Map[loc[j - ]][i]);
    for(int i = ; i <= m; i++)
    for(int j = i + ; j <= m; j++)
    for(int k = ; k <= r; k++)
    hh[i][j] += abs(Map[loc[k]][i] - Map[loc[k]][j]);
    for(int i = ; i <= m; i++)
    f[][i] = ll[i];
    for(int i = ; i <= c; i++)
    for(int j = ; j <= m; j++)
    for(int k = j + ; k <= m ; k++)
    f[i][k] = min(f[i][k], f[i - ][j] + ll[k] + hh[j][k]);
    for(int i = c; i <= m; i++)
    ans = min(ans, f[c][i]);
}
inline void dfs(int x, int pre)
{
    if (x == r + )
    {
        solve();
        return;
    }
    for(int i = pre + ; n - i >= r - x; i++)
    loc[x] = i,
    dfs(x + , i);
}
int main()
{
    while(~scanf("%d%d%d%d", &n, &m, &r, &c))
    {
        ans = 0x3f3f3f3f;
        memset(loc, , sizeof loc);
        for(int i = ; i <= n; i++)
        for(int j = ; j <= m; j++)
        scanf("%d", &Map[i][j]);
        dfs(, );
        printf("%d\n", ans);
    }
}