SPOJ GCJ1C09C DP

来源：互联网发布：查看是否安装mysql 编辑：程序博客网时间：2024/06/06 06:57

对监狱区间dp，也很好理解，不再赘述。

#include <algorithm>#include <cstring>#include <cstdlib>#include <cstdio>#include <queue>#include <map>using namespace std;const int INF = 0x3f3f3f3f;const int maxn = 10005;int a[maxn];int P, Q;struct State{    int s, e;    State(int a, int b){s = a; e = b;}    bool operator < (const State &b) const{        return s < b.s || ((s == b.s) && (e < b.e));    }};map<State, int> ma;int Dp(int s, int e){    State c(s, e);    if (ma.count(c)) return ma[c];    int l = lower_bound(a, a + Q, s) - a;    int r = upper_bound(a, a + Q, e) - a;    if (l >= r) return ma[c] = 0;    int ans = INF;    for (int i = l; i < r; i++)        ans = min(ans, e - s + Dp(s, a[i] - 1) + Dp(a[i] + 1, e));    return ma[c] = ans;}int main(){    //freopen("1.txt", "r", stdin);    int T, Case = 1;    scanf("%d", &T);    while (T--){        scanf("%d%d", &P, &Q);        memset(a, INF, sizeof(a));        for (int i = 0; i < Q; i++)            scanf("%d", &a[i]);        ma.clear();        printf("Case #%d: ", Case++);        printf("%d\n", Dp(1, P));    }    return 0;}

0 0