传送门:【HDU】4160 Dolls
题目分析:有向无环图的最小路径覆盖,所有满足条件的点之间建边即可。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
#define REP( i , a , b ) for ( int i = a ; i < b ; ++ i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REV( i , a , b ) for ( int i = a ; i >= b ; -- i )
#define CLR( a , x ) memset ( a , x , sizeof a )
const int MAXN = 505 ;
const int MAXQ = 505 ;
const int MAXE = 250005 ;
const int INF = 0x3f3f3f3f ;
struct Edge {
int v , n ;
Edge () {}
Edge ( int v , int n ) : v ( v ) , n ( n ) {}
} ;
struct Doll {
int w , l , h ;
void input () {
scanf ( "%d%d%d" , &w , &l , &h ) ;
}
bool operator < ( const Doll &a ) const {
return w < a.w && l < a.l && h < a.h ;
}
} ;
struct Match {
Edge E[MAXE] ;
int H[MAXN] , cntE ;
int Lx[MAXN] , Ly[MAXN] ;
int dx[MAXN] , dy[MAXN] ;
int Q[MAXN] , head , tail ;
bool vis[MAXN] ;
int n ;
int distance ;
Doll doll[MAXN] ;
void init () {
cntE = 0 ;
CLR ( H , -1 ) ;
CLR ( Lx , -1 ) ;
CLR ( Ly , -1 ) ;
}
void addedge ( int u , int v ) {
E[cntE] = Edge ( v , H[u] ) ;
H[u] = cntE ++ ;
}
int Hopcroft_Karp () {
distance = INF ;
head = tail = 0 ;
CLR ( dx , -1 ) ;
CLR ( dy , -1 ) ;
FOR ( i , 1 , n )
if ( Lx[i] == -1 ) {
Q[tail ++] = i ;
dx[i] = 0 ;
}
while ( head != tail ) {
int u = Q[head ++] ;
if ( dx[u] >= distance )
continue ;
for ( int i = H[u] ; ~i ; i = E[i].n ) {
int v = E[i].v ;
if ( dy[v] == -1 ) {
dy[v] = dx[u] + 1 ;
if ( Ly[v] == -1 ) {
distance = dy[v] ;
} else {
dx[Ly[v]] = dy[v] + 1 ;
Q[tail ++] = Ly[v] ;
}
}
}
}
return distance != INF ;
}
int find ( int u ) {
for ( int i = H[u] ; ~i ; i = E[i].n ) {
int v = E[i].v ;
if ( !vis[v] && dy[v] == dx[u] + 1 ) {
vis[v] = 1 ;
if ( ~Ly[v] && dy[v] == distance )
continue ;
if ( Ly[v] == -1 || find ( Ly[v] ) ) {
Lx[u] = v ;
Ly[v] = u ;
return 1 ;
}
}
}
return 0 ;
}
int match ( int ans = 0 ) {
while ( Hopcroft_Karp () ) {
CLR ( vis , 0 ) ;
FOR ( i , 1 , n )
if ( Lx[i] == -1 )
ans += find ( i ) ;
}
return ans ;
}
void solve () {
init () ;
FOR ( i , 1 , n )
doll[i].input () ;
FOR ( i , 1 , n )
FOR ( j , 1 , n )
if ( doll[i] < doll[j] )
addedge ( i , j ) ;
printf ( "%d\n" , n - match () ) ;
}
} e ;
int main () {
while ( ~scanf ( "%d" , &e.n ) && e.n )
e.solve () ;
return 0 ;
}