题意:
给
n(≤200)
个区间
(ai,bi)
,要求从中选择一些区间使得和最大,而且满足
∀x,(∑i[ai<x<bi])≤k
。
题解:
发现最优决策一定可以分解为不超过
k
个不相交的区间。那么直接连边做
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
inline int rd(){
char ch=getchar();int i=0,f=1;
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){i=(i<<1)+(i<<3)+ch-'0';ch=getchar();}
return i*f;
}
const int Maxn=4e2+50,Maxm=4e4+50,INF=0x3f3f3f3f;
int n,k,g[Maxn],v[Maxm],c[Maxm],w[Maxm],nt[Maxm],lsh[Maxm],tot,vt,ec=1;
int a[Maxn],b[Maxn],val[Maxn],src,des,walk[Maxn],dis[Maxn],cur[Maxn];
long long ans;
inline void add(int x,int y,int o,int wi){
++ec;nt[ec]=g[x];g[x]=ec;v[ec]=y;w[ec]=wi;c[ec]=o;
++ec;nt[ec]=g[y];g[y]=ec;v[ec]=x;w[ec]=-wi;c[ec]=0;
}
inline bool spfa(){
queue<int>q;
for(int i=src;i<=des;i++)dis[i]=INF;
dis[src]=0;q.push(src);
while(!q.empty()){
int u=q.front();q.pop();
for(int j=g[u];j;j=nt[j]){
if(!c[j]||dis[v[j]]<=dis[u]+w[j])continue;
dis[v[j]]=dis[u]+w[j];q.push(v[j]);
}
}
return dis[des]<INF;
}
inline int dinic(const int &x,int f,int co){
if(x==des)return ans+=1ll*f*co,f;
int rs=0;walk[x]=vt;
for(int &j=cur[x];j;j=nt[j]){
if(!c[j]||(walk[v[j]]==vt)||(dis[v[j]]<dis[x]+w[j]||(dis[x]<=-INF)))continue;
int o=dinic(v[j],min(f-rs,c[j]),co+w[j]);
rs+=o;c[j]-=o;c[j^1]+=o;
if(rs==f)return rs;
}
return dis[x]=-INF,rs;
}
inline int mincostflow(){
while(spfa()){
++vt,memcpy(cur,g,sizeof(cur));
while(dinic(src,INF,0))++vt,memcpy(cur,g,sizeof(cur));
}
return -ans;
}
int main(){
for(int tt=rd();tt>=1;--tt){
ec=1;memset(g,0,sizeof(g));
n=rd(),k=rd();tot=0;ans=0;
for(int i=1;i<=n;i++)a[i]=rd(),b[i]=rd(),val[i]=rd(),lsh[++tot]=a[i],lsh[++tot]=b[i];
sort(lsh+1,lsh+tot+1);tot=unique(lsh+1,lsh+tot+1)-lsh-1;
for(int i=1;i<=n;i++){
int x=lower_bound(lsh+1,lsh+tot+1,a[i])-lsh,y=lower_bound(lsh+1,lsh+tot+1,b[i])-lsh;
add(x,y,1,-val[i]);
}
for(int i=0;i<=tot;i++)add(i,i+1,k,0);
src=0;des=tot+1;printf("%d\n",mincostflow());
}
}