uvalive6938

离散化加dp

大神的代码有点难理解

没时间写了就贴上

#include <cstdio>#include <algorithm>#include <cstring>#include <string.h>#include <cstring>using namespace std;typedef long long ll;int const MAXS = 60 * 1024 * 1024;char buf[MAXS], *c;inline ll get_int() {    ll p = 0;    while (*c < '0' || *c > '9') ++ c;    while ('0' <= *c && *c <= '9') p = p * 10 + (*c - '0'), ++ c;    return p;}#define INF 0x7f7f7f7fint const N = 1e4 + 20;int value[N * 2], a[N], b[N], d[N], n;int f[N][N];int main() {    int T ;    scanf("%d",&T);    while (T--) {    scanf("%d",&n);    for (int i = 0; i < n; ++ i)        scanf("%d%d%d",&a[i],&b[i],&d[i]);    for (int i = 0; i < n; ++ i)        value[i * 2] = a[i], value[i * 2 + 1] = b[i];    sort(value, value + 2 * n);    int cnt = unique(value, value + 2 * n) - value;    for (int i = 0; i < n; ++ i) {        a[i] = lower_bound(value, value + cnt, a[i]) - value + 1;        b[i] = lower_bound(value, value + cnt, b[i]) - value + 1;    }    for(int i=0;i<n;i++) //printf("%d %d %d\n",a[i],b[i],d[i]);//    memset(f,INF,sizeof(f));    ++ cnt; //printf("%d\n",cnt);    for (int l = 0; l <= cnt; ++ l)        for (int i = 0; i <= cnt - l; ++ i) {            int j = i + l, best = -1, k;            for (k = 0; k < n; ++ k)                if (i < a[k] && b[k] < j && (best == -1 || d[best] < d[k]))                {                    best = k;//                    printf("i %d a[k] %d j %d b[k] %d  d[k] %d\n",i,a[k],j,b[k],d[k]);                }            if (best == -1) f[i][j] = 0;            else for (f[i][j] = (int)1e9, k = a[best]; k <= b[best]; ++ k)                f[i][j] = min(f[i][j], d[best] + f[i][k] + f[k][j]);        }//    for(int i=0;i<=cnt*2;i++){//        for(int j=0;j<=cnt*2;j++)//        printf("%d ",f[i][j]); printf("\n");//    }    printf("%d\n", f[0][cnt]);    }    return 0;}