对于每一个区间,完全包含在之内的,最高的那个一定要被选。
选择之后,枚举切割点分成两部分,而跨越切割点的就自然默认为已经被选中淘汰。
By cqsh3vj2, contest: 2014-2015 ACM-ICPC, Central Europe Regional Contest (CERC 14), problem: (L) Outer space invaders, Accepted, #
#include<iostream>
#include<algorithm>
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define inf 0x3f3f3f3f
int x[305],y[305],h[305];
int dp[610][610];
int n;
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int i,j,k;
scanf("%d",&n);
vector<int>ends;
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&x[i],&y[i],&h[i]);
ends.push_back(x[i]);
ends.push_back(y[i]);
}
ends.push_back(-inf);
ends.push_back(+inf);
sort(ends.begin(),ends.end());
ends.erase(unique(ends.begin(),ends.end()),ends.end());
int d,cnt,heightest;
// vector<int>::iterator ll,rr;
cnt=ends.size();
for(d=1;d<cnt;d++)
for(i=0;i+d<cnt;i++)
{
j=i+d;
heightest=-1;
for(k=1;k<=n;k++)
if(x[k]>ends[i] && y[k]<ends[j] && (h[k]>h[heightest]||heightest==-1))
heightest=k;
if(heightest==-1)
dp[i][j]=0;
else
{
int hleft = 0;
while (ends[hleft] != x[heightest])
hleft++;
int hright = 0;
while (ends[hright] != y[heightest])
hright++;
dp[i][j]=inf;
for(k= hleft ;k <= hright;k++)
dp[i][j]=min(dp[i][j],h[heightest]+dp[i][k]+dp[k][j]);
}
}
printf("%d\n",dp[0][cnt-1]);
}
return 0;
}