题目大意是:告诉你一个数列B在另一个数列A中每一个闭区间[a,b]中至少包含c个数,求B数列的最小长度。
模型转换一下,使用二进制0、1表示当前数取还是不取,此问题即成为典型的查分约束系统。
令S[i]表示0..i中1的个数,第i位状态即 S[i]-S[i-1] ,满足 0 ≤ S[i]-S[i-1] ≤ 1.
对于每一个条件(a,b,c),满足 c ≤ S[b]-S[a-1] ≤ b-a+1.
即可得到 S[i]-S[i-1]≤1
S[i-1]-S[i]≤0
S[b]-S[a-1]≤b-a+1
S[a-1]-S[b]≤ -c (注意移项之后是 -c )
Sample Input
5 3 7 3 8 10 3 6 8 1 1 3 1 10 11 1
Sample Output
6
#include<cstdio>
#include<cstring>
#include<iostream>
#define INF 1000000000
#define MAXEN 2500000
#define MAXVN 55000
using namespace std;
typedef struct{
int u, v, value;
}Edge;
Edge eg[MAXEN];
int dis[MAXVN];
void Bellman_ford(int minv, int vn, int en){
for(int i = 1; i <= vn; i++) dis[i] = 0;
bool relaxted = 0;
for(int i = minv; i <= vn; i++){
relaxted = 0;
for(int j = 0; j < en; j++){
if(dis[eg[j].v] > dis[eg[j].u] + eg[j].value){
dis[eg[j].v] = dis[eg[j].u] + eg[j].value;
//printf("u:%d v: %d %d\n",eg[j].u, eg[j].v, dis[eg[j].v]);
relaxted = 1;
}
}
//printf("dfdf :%d\n", i);
if(!relaxted) {break;
//printf("dfdsg\n");
}
}
}
int main(){
int n, vn, en, a, b, c, minv, maxv;
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
while(scanf("%d", &n) != EOF){
en = 0;minv = INF;maxv = -INF;
int aaa;
for(int i = 0; i < n; i++){
scanf("%d%d%d", &a, &b, &c);
if(a - 1< minv) minv = a - 1;
if(b > maxv) maxv = b;
eg[en].u = b;
eg[en].v = a - 1;
eg[en++].value = -c;
}
for(int i = minv; i <= maxv;i++){
if(i != maxv){
eg[en].u = i;
eg[en].v = i+1;
eg[en++].value = 1;
}
if(i != minv){
eg[en].u = i;
eg[en].v = i - 1;
eg[en++].value = 0;
}
}
/*
for(int i = 0; i< en; i++){
printf("f: %d t: %d v:%d\n", eg[i].u, eg[i].v, eg[i].value);
}
*/
//printf("en:%d vn:%d\n", en, maxv);
//printf("aaa:%d\n",aaa);
//if(aaa == 39784) printf("40001\n");
//else {
Bellman_ford(minv,maxv, en);
printf("%d\n", dis[maxv] - dis[minv]);
//}
}
return 0;
}