每次遇到二分都挑不出来------
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#define N 105
using namespace std;
int link[N], vis[N];
int mat[N][N];
int x;
int maxx, minn;
int MAXX, MINN;
int n, mid;
int dfs( int u )
{
for ( int i = 1; i <= n; i++ )
{
if( !vis[i] && mat[u][i] >= x && (mat[u][i] <= (x + mid)) )
{
vis[i] = 1;
if( link[i] == -1 || dfs(link[i]) )
{
link[i] = u;
return 1;
}
}
}
return 0;
}
int hungary()
{
memset(link, -1, sizeof(link));
for ( int i = 1; i <= n; i++ )
{
memset(vis, 0, sizeof(vis));
if( !dfs(i) )
return 0;
}
return 1;
}
int main()
{
int tot;
scanf("%d", &tot);
while(tot--)
{
scanf("%d", &n);
MAXX = -1, MINN = 99999;
for ( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
{
scanf("%d", &mat[i][j]);
MAXX = MAXX > mat[i][j] ? MAXX: mat[i][j];
MINN = MINN < mat[i][j] ? MINN: mat[i][j];
}
}
maxx = MAXX - MINN;
minn = 0;
while(1)
{
mid = (maxx + minn) >> 1;
bool f = 0;
for( x = MINN; x + mid <= MAXX; x++)
{
if ( hungary() )
{
f = 1;
break;
}
}
if( f )
maxx = mid;
if( mid == minn )
break;
if( !f )
minn = mid;
}
printf("%d\n", maxx);
}
return 0;
}