GCJ 2009 Bribe the Prisoners

区间DP……但是细节处理比较多，代码要一些技巧……算水题吧

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cmath>
#include <vector>
using namespace std;#define LL long long
void nextInt(int &x)
{scanf("%d", &x);
}
void nextInt(int &x, int &y)
{scanf("%d%d", &x, &y);
}const LL maxn = 500;
int n;
int p;
int a[maxn];
int f[maxn][maxn];void init()
{nextInt(n, p);for (int i = 1; i <= p; ++ i)nextInt(a[i]);a[0] = 0;a[p + 1] = n + 1;sort(a, a + 2 + p);//for (int i = 0; i <= p + 1; ++ i) cout<<a[i]<<endl;memset(f, 0, sizeof(f));for (int w = 2; w <= p + 1; ++ w)//长度for (int i = 0; w + i <= p + 1; ++ i)//开始位置{//(i, i + w)区间， 实际可用区间为[i + 1, i + w - 1]f[i][i + w] = a[w + i] - a[i] - 2;int tmp = 0x7fffffff;for (int k = i + 1; k <= i + w - 1; ++ k){tmp = min(tmp, f[i][k] +  f[k][i + w]);}f[i][i + w] += tmp;}printf("%d\n", f[0][p + 1]);
}int main()
{freopen("a.in","r",stdin);freopen("a.txt","w",stdout);LL sb;scanf("%lld", &sb);for (int i = 1; i <= sb; ++ i){printf("Case #%d: ", i);init();}return 0;
}

GCJ 2009 Bribe the Prisoners相关推荐

[dp]GCJ 2009 Bribe the Prisoners
原文原作者 lizo_is_me 问题描述: 一个监狱里有P个并排着的牢房,从左往右一次编号为1,2,-,P.最初所有牢房里面都住着一个囚犯.现在要释放一些囚犯.如果释放某个牢房里的囚犯,必须要贿赂 ...
Bribe the Prisoners 菜鸟的记录
Bribe the Prisoners 题目大意有一个监狱里有一排牢房1-P,其中住着一些囚犯.现在要释放一些囚犯Q, 当释放一个囚犯的时候,要给两边所有的囚犯每人一枚金币, 直到遇到空牢房或者尽头 ...
Bribe the Prisoners SPOJ - GCJ1C09C
滴答滴答---题目链接贿赂囚犯 Bribe the prisoners ( 动态规划+剪枝) Problem In a kingdom there are prison cells (numbere ...
[区间记忆化dp入门][Bribe the Prisoners SPOJ - GCJ1C09C][Codeforces Round #505D (rated, Div. 1 + Div. 2, ba]
Bribe the Prisoners SPOJ - GCJ1C09C 作为这类题代表,f[i][j]代表第i点到第j点单独处理的最值这题关键:释放某个囚犯后,就把囚犯分成两段,两段互相独立这类d ...
GCJ 2009 Round1C C Bribe the Prisoners
/*这题终于对了,真是感激涕零,痛苦流涕,这个故事告诉我们:前人的经验果然是有道理的,INF就不要乱设置了,就设0x3f3f3f3f就好当然,还有一个问题就是,不要随便设置long long型,因为每 ...
Bribe the Prisoners——GCJ 2009 Round1C C(区间dp)
题目:P个并排的牢房(1,2,3....P).每个牢房一个囚犯.现在要释放其中的Q个囚犯.每释放一个囚犯,就得向左给每一个相邻囚犯一枚金币,直到遇到空牢房.向右也是如此.问以什么样的顺序释放所花费的金 ...
Bribe the Prisoners(GCJ 2009 Round 1C C)（dp）
题意: 一个监狱里有P个并排着的牢房.从左至右依次编号为1,2,...,P.最初所有的牢房里都住着一个囚犯.相邻的两个牢房之间可以互通信息. 现在要释放一些囚犯.如果释放某个牢房里的囚犯,其相邻的牢房 ...
刷题： bribe the prisoners(2009 Round 1C C)
题目描述 In a kingdom there are prison cells (numbered 1 to P) built to form a straight line segment. Ce ...
挑战2.7.3 Round 1C 2009 C. Bribe the Prisoners 区间dp
题目链接: https://code.google.com/codejam/contest/189252/dashboard#s=p2 题意: 题解: 区间dp dp[i][j] 表示释放a[i]~a ...

GCJ 2009 Bribe the Prisoners

GCJ 2009 Bribe the Prisoners相关推荐

最新文章

热门文章