csu 1326 The contest

裸的   并查集  +  分组背包；  

#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
using namespace std;

vector<int>vv[1002];
vector<int>ss[1002];
int f[1002],N,M,W,wi[1002],pi[1002],dp[1012];
int find( int x ){
    if( x != f[x] )return f[x] = find(f[x]);
    return x;
}
void inint( ){
    memset( dp,0,sizeof(dp) );
    for( int i = 0; i <= N; i++ ) f[i] = i;
    for( int i = 0; i <= N; i++ )vv[i].clear();
    for( int i = 0; i <= N; i++ )ss[i].clear();
    for( int j = 1; j <= N; j++ )
        scanf("%d%d",&pi[j],&wi[j]);
}
int main( )
{
     while( scanf("%d%d%d",&N,&W,&M) != EOF )
     {
         inint( );
         for( int i = 1; i <= M; i++ )
         {
             int u,v; scanf("%d%d",&u,&v);
             u = find( u );  v = find( v );
             if( u != v )f[u] = v;
         }
        for( int i = 1; i <= N; i++ )
            vv[find(i)].push_back(i);
        int k = 0;
        for( int i = 1; i <= N; i++ )
        {
            int len = vv[i].size();
            if( len == 0 )continue; k++;
            for( int j = 0; j < len; j++ )
            ss[k].push_back(vv[i][j]);
        }
        for( int i = 1; i <= k; i++ )                       // 这里是分组背包；
        for( int j = W; j >= 0; j-- )
        for( int t = 0; t < ss[i].size( ); t++ )
        if( j >= wi[ss[i][t]] )
            dp[j] = max( dp[j],dp[j - wi[ss[i][t]]] + pi[ss[i][t]] );
        cout<<dp[W]<<endl;
     }
     return 0;
}