hdu4160 二分匹配

http://acm.hdu.edu.cn/showproblem.php?pid=4160

#include<iostream>#include<cstdio>#include<cstring>using namespace std;struct node{int wi,li,hi;};node a[505];int map[505][505];int n;int link1[505];int vis[505];void fit(){int i,j;for(i=0;i<n;i++){for(j=0;j<n;j++)if(a[i].wi>a[j].wi&&a[i].li>a[j].li&&a[i].hi>a[j].hi)map[i][j]=1;}}int can(int i){int j;for(j=0;j<n;j++){if(!vis[j]&&map[i][j]){vis[j]=1;if(link1[j]==-1||can(link1[j])){link1[j]=i;return 1;}}}return 0;}int main(){while(scanf("%d",&n),n!=0){int i;for(i=0;i<n;i++)scanf("%d%d%d",&a[i].wi,&a[i].li,&a[i].hi);memset(map,0,sizeof(map));memset(link1,-1,sizeof(link1));fit();int sum=0;for(i=0;i<n;i++){memset(vis,0,sizeof(vis));if(can(i))sum++;}printf("%d\n",n-sum);}}