题目大意:
给定直线L上n个开区间组成的集合I,和一个正整数k,设计一个算法,从开区间集合I中选取出开区间集合S(S属于I), 使得在直线L的任何一个点x,S中包含点x的开区间个数不超过k,且z的绝对值的和最大(z属于s,指的是区间长度)。这样的集合S成为开区间集合I的最长k可重区间集。z的绝对值的和称为最长k可重区间集的长度。
对于给定的开区间集合数I和正整数k,计算开区间集合I的最长k可重区间集的长度。
输入:
4 2
1 7
6 8
7 10
9 13
输出:
15 ((7-1)+(8-6)+(10-7)+(13-9))
思路分析:
①:将所有开区间的端点同一排序,离散化;
②:设立一个源点s,从s向最左边的端点连一条有向边,流量为k,费用为0;
③:设立一个汇点t,从最右边的端点向t连一条边,流量为k,费用为0;
④:从第i个点向第i+1个点连一条边,容量为1,给用为0;
⑤:将之前的区间(a,b)离散化的(i,j),从i向j连一条有向边,容量为1,费用为原区间长度的负值;
代码实现:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<algorithm>
#define Min(a, b) ((a)<(b)?(a):(b))
#define Max(a, b) ((a)>(b)?(a):(b))
using namespace std;
const int N=101000, M=900000, INF=0x3f3f3f3f;
int n, k ,s, t, top, sum_cost;
int head[N], vis[N], dis[N], path[N], minflow[N], pre[N], ran[N][3], sec[N], flag[N];
struct Edge{
int to, next, flow, cost;
Edge(int _to=0, int _next=0, int _flow=0, int _cost=0):to(_to),next(_next),flow(_flow),cost(_cost){}
}edge[M];
void Addedge(int from, int to, int flow, int cost){
edge[top] = Edge(to, head[from], flow, cost);
head[from] = top++;
edge[top] = Edge(from, head[to], 0, -cost);
head[to] = top++;
}
int Spfa(){
queue<int> q;
memset(dis, 0x3f, sizeof(dis));
memset(minflow, 0x3f, sizeof(minflow));
memset(path, -1, sizeof(path));
memset(vis, 0, sizeof(vis));
dis[s] = 0; q.push(s);
while(!q.empty()){
int u = q.front(); q.pop();
vis[u] = 0;
for(int i = head[u]; i+1; i = edge[i].next){
if(edge[i].flow && dis[edge[i].to] > dis[u] + edge[i].cost){
dis[edge[i].to] = dis[u] + edge[i].cost;
pre[edge[i].to] = u;
path[edge[i].to] = i;
minflow[edge[i].to] = Min(minflow[u], edge[i].flow);
if(!vis[edge[i].to]){
vis[edge[i].to] = 1;
q.push(edge[i].to);
}
}
}
}
if(dis[t] == INF) return 0;
sum_cost += minflow[t]*dis[t];
int u = t;
while(u!=s){
edge[path[u]].flow -= minflow[t];
edge[path[u]^1].flow += minflow[t];
u = pre[u];
}
return 1;
}
int main(){
freopen("interv.in", "r", stdin);
freopen("interv.out", "w", stdout);
scanf("%d%d", &n, &k);
memset(head, -1, sizeof(head));
top = s = 0;
int cnt = 0, c = 1;
for(int i = 1; i <= n; ++i){
scanf("%d%d", &ran[i][0], &ran[i][1]);
sec[++cnt] = ran[i][0], sec[++cnt] = ran[i][1];
}
sort(sec+1, sec+cnt+1);
for(int i = 1; i <= cnt; ++i) flag[sec[i]] = i;
t = n*2 + 1;
Addedge(s, 1, k, 0);
Addedge(cnt, t, k, 0);
for(int i = 1; i < cnt; ++i) Addedge(i, i+1, INF, 0);
for(int i = 1; i <= n; ++i) Addedge(flag[ran[i][0]], flag[ran[i][1]], 1, ran[i][0]-ran[i][1]);
while(Spfa());
printf("%d\n",-sum_cost);
}