Google Code Jam 2009, Round 1C C. Bribe the Prisoners (记忆化dp)

Problem

In a kingdom there are prison cells (numbered 1 to P) built to form a straight line segment. Cells number i and i+1 are adjacent, and prisoners in adjacent cells are called "neighbours." A wall with a window separates adjacent cells, and neighbours can communicate through that window.

All prisoners live in peace until a prisoner is released. When that happens, the released prisoner's neighbours find out, and each communicates this to his other neighbour. That prisoner passes it on to his other neighbour, and so on until they reach a prisoner with no other neighbour (because he is in cell 1, or in cell P, or the other adjacent cell is empty). A prisoner who discovers that another prisoner has been released will angrily break everything in his cell, unless he is bribed with a gold coin. So, after releasing a prisoner in cell A, all prisoners housed on either side of cell A - until cell 1, cell P or an empty cell - need to be bribed.

Assume that each prison cell is initially occupied by exactly one prisoner, and that only one prisoner can be released per day. Given the list of Q prisoners to be released in Qdays, find the minimum total number of gold coins needed as bribes if the prisoners may be released in any order.

Note that each bribe only has an effect for one day. If a prisoner who was bribed yesterday hears about another released prisoner today, then he needs to be bribed again.

Input

The first line of input gives the number of cases, N. N test cases follow. Each case consists of 2 lines. The first line is formatted as

P Q

where  P  is the number of prison cells and  Q  is the number of prisoners to be released.
This will be followed by a line with  Q  distinct cell numbers (of the prisoners to be released), space separated, sorted in ascending order.

Output

For each test case, output one line in the format

Case #X: C

where  X  is the case number, starting from 1, and  C  is the minimum number of gold coins needed as bribes.

Limits

1 ≤ N ≤ 100
Q ≤ P
Each cell number is between 1 and P, inclusive.

Small dataset

1 ≤ P ≤ 100
1 ≤ Q ≤ 5

Large dataset

1 ≤ P ≤ 10000
1 ≤ Q ≤ 100

Sample

Input	Output
2 8 1 3 20 3 3 6 14	Case #1: 7 Case #2: 35

Note

In the second sample case, you first release the person in cell 14, then cell 6, then cell 3. The number of gold coins needed is 19 + 12 + 4 = 35. If you instead release the person in cell 6 first, the cost will be 19 + 4 + 13 = 36.

题目大意：

t 组测试数据，n个人在监狱，要放出m个人，每放出一个人，他周围的人（两边连续的直到碰到空的监狱或者尽头）都要贿赂1个钱，问最少的总花费

解题思路：

记忆化dp，dp(i,j) 表示从 编号 a[i] ~ a[j] 不包含 a[i] 与 a[j] 的子树的花费

状态转移方程 d[i][j]=min(dp(i,k)+dp(k,j)+(a[j]-a[i]-2),d[i][j]) 

注意，一开始添加哨兵，0号位与n+1号位

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int maxn=110;
const int inf=1e9;
int n,m,a[maxn],d[maxn][maxn];

void initial(){
	for(int i=0;i<=m+1;i++)
	for(int j=0;j<=m+1;j++)
	d[i][j]=inf;
}

void input(){
	a[0]=0;a[m+1]=n+1;
	for(int i=1;i<=m;i++) scanf("%d",&a[i]);
}

int dp(int i,int j){
	if(d[i][j]!=inf) return d[i][j];
	if(i+1>=j) return 0;
	for(int k=i+1;k<=j-1;k++){
		d[i][j]=min(dp(i,k)+dp(k,j)+(a[j]-a[i]-2),d[i][j]);
	}
	return d[i][j];
}

void computing(){
	cout<<dp(0,m+1)<<endl;
}

int main(){
	freopen("C-large-practice.in","r",stdin);
	freopen("C-large-practice.out","w",stdout);
	int t;
	cin>>t;
	for(int i=1;i<=t;i++){
		scanf("%d%d",&n,&m);
		initial();
		input();
		printf("Case #%d: ",i);
		computing();
	}
	return 0;
}

转载于:https://www.cnblogs.com/toyking/p/3797360.html