题意: 有一个n排m列的矩阵,可以任意更换每一行的位置,要求最后的结果矩阵从上到下,从左到右的数字组成的数字串相邻数字之间的差值的最小值最大
根据n<=16,m<=1e4可以清晰的意识到该题是状态压缩题,我们构造这样一个dp数组
注意到对于任意两行,不考虑顶,底层的换列权值,当两行相邻时,他们之间的最小权值是确定的
dpi,j,k:表示结果矩阵中顶层为第i行,底层为第j行,而状态为k的最大结果值(k位为1的位置即使用了第i行,反之则没有使用),并且记录结果值建立在这样一个条件下,不考虑换列时的值,因为顶层,底层在状态转移时不断变化,换列的值也不断变化,受限蒟蒻的技术,无法实现即时的记录。
然后很简单的枚举所有状态,枚举顶,底层,枚举倒数第二层转移,即
dp[s][t][i | (1 << t)] = max(dp[s][t][i | (1 << t)], min(dp[s][j][i], dist[j][t]))(j为倒数第二层)
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>
//#define int ll
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 998244353;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
int a[20][10010];
int dist[20][20],nexdist[20][20];
int dp[20][20][1 << 16];
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() { }
void slove()
{
cin >> n >> m;
pre(i, 0, n - 1)
pre(j, 0, m - 1)
cin >> a[i][j];
if (n == 1)
{
int ans = INF;
pre(i, 0, m - 2) ans = min(ans, abs(a[0][i + 1] - a[0][i]));
cout << ans << endl;
}
else {
pre(i, 0, n - 1)
{
pre(j, 0, n - 1)
{
dist[i][j] = nexdist[i][j] = INF;
if (i == j)continue;
pre(k, 0, m - 1)
{
dist[i][j] = min(dist[i][j], abs(a[i][k] - a[j][k]));
if (k != 0)nexdist[i][j] = min(nexdist[i][j], abs(a[i][k - 1] - a[j][k]));
}
}
}
pre(i, 0, n - 1)dp[i][i][1 << i] = INF;
pre(i, 1, (1 << n) - 1)
{
pre(s, 0, n - 1)
{
if (((i >> s) & 1)==0)continue;
pre(t, 0, n - 1)
{
if (s == t || ((i >> t) & 1)==1) continue;
pre(j, 0, n - 1) {
if (((i >> j) & 1) == 0)continue;
dp[s][t][i | (1 << t)] = max(dp[s][t][i | (1 << t)], min(dp[s][j][i], dist[j][t]));
}
}
}
}
int ans = 0, st = (1 << n) - 1;
pre(i,0,n-1)
pre(j, 0, n - 1)
{
if (i == j)continue;
ans = max(ans, min(nexdist[i][j], dp[i][j][st]));
}
cout << ans << endl;
}
}
signed main()
{
int _;
//cin >> _;
_ = 1;
init();
while (_--)
{
slove();
}
return 0;
}