思路:
先求出二分图的最大匹配,然后二分找答案。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=505;
int a[maxn][maxn];
int g[maxn][maxn];
int n,Max=-1;
int vis[maxn];
int match[maxn];
bool Find(int x)
{
for (int i=1;i<=n;i++)
{
if(!vis[i]&&g[x][i])
{
vis[i]=1;
if(match[i]==-1||Find(match[i]))
{
match[i]=x;
return true;
}
}
}
return false;
}
int algor()
{
memset (match,-1,sizeof(match));
int ans=0;
for (int i=1;i<=n;i++)
{
memset (vis,0,sizeof(vis));
if(Find(i)) ans++;
}
return ans;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
memset (g,0,sizeof(g));
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]) g[i][j]=1;
}
}
int t=algor();
int l=0,r=1e9,ans=0;
while(l<r)
{
memset (g,0,sizeof(g));
int mid=(l+r+1)/2;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
if(a[i][j]>=mid) g[i][j]=1;
}
}
if(algor()==t) {
l=mid;
}
else r=mid-1;
}
printf("%d\n",l);
}
return 0;
}