Cards and Joy

http://codeforces.com/contest/999/problem/F

问题描述：

There are $n$ players sitting at the card table. Each player has a favorite number. The favorite number of the $j$-th player is $f_j$.

There are $k\cdot n$ cards on the table. Each card contains a single integer: the $i$-th card contains number $c_i$. Also, you are given a sequence $h_1,h_2,\dots ,h_k$. Its meaning will be explained below.

The players have to distribute all the cards in such a way that each of them will hold exactly $k$ cards. After all the cards are distributed, each player counts the number of cards he has that contains his favorite number. The joy level of a player equals $h_t$ if the player holds $t$ cards containing his favorite number. If a player gets no cards with his favorite number (i.e., $t=0$), his joy level is $0$.

Print the maximum possible total joy levels of the players after the cards are distributed. Note that the sequence $h_1,\dots ,h_k$ is the same for all the players.

Input

The first line of input contains two integers $n$ and $k$ ($1\le n\le 500,1\le k\le 10$) — the number of players and the number of cards each player will get.

The second line contains $k\cdot n$ integers $c_1,c_2,\dots ,c_{k\cdot n}$ ($1\le c_i\le {10}^5$) — the numbers written on the cards.

The third line contains $n$ integers $f_1,f_2,\dots ,f_n$ ($1\le f_j\le {10}^5$) — the favorite numbers of the players.

The fourth line contains $k$ integers $h_1,h_2,\dots ,h_k$ ($1\le h_t\le {10}^5$), where $h_t$ is the joy level of a player if he gets exactly $t$ cards with his favorite number written on them. It is guaranteed that the condition $h_{t-1}<h_t$ holds for each $t\in \left[\mathrm{2..}k\right]$.

Output

Print one integer — the maximum possible total joy levels of the players among all possible card distributions.

问题分析：本题的大意是n个人分配k个数，每个人都有其喜欢的数，k个数中喜欢的数越多，其获得的满足感h就越高，求所有的人可以获得最大的满足感。

这题明显是一道动态规划问题，用dp[i][j]表示某一个数可以让人获得的最大满足感，其中 i表示某一个数在n*k个数中一共有i个数，j表示这个数是人喜欢的数在n个数中有j个。状态转移方程为:dp[i][j] = max(dp[i][j],dp[i-w][j-1]+h[i])

AC代码：

#include <iostream>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<set>
#include<stack>
#include<queue>
using namespace std;

const int N = 100005;

int n,k;
int c[N],f[N],h[15];
long long dp[5050][5050];
long long getdp(int a,int b){
	if(a <= 0 || b <= 0)
	return 0;
	long long &res = dp[a][b];
	if(res != -1)
	return res;
	res = 0;
	for(int i = 0;i <= min(a,k);i++){
		//状态转移方程 
		res = max(res,h[i]+getdp(a-i,b-1));
	}
	return res;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>k;
	for(int i = 0;i < k*n;i++){
		int x;
		cin>>x;
		c[x]++;
	}
	for(int i = 0;i < n;i++){
		int x;
		cin>>x;
		f[x]++;
	}
	for(int i = 1;i <= k;i++){
		cin>>h[i];
	}
	long long ans = 0;
	memset(dp,-1,sizeof(dp));
	for(int i = 1;i <= 100000;i++){
		ans += getdp(c[i],f[i]);	
	}
	cout<<ans<<endl;
	return 0;
}