【POJ 1201】Intervals（差分约束+SPFA）

最新推荐文章于 2021-04-22 23:08:15 发布

reverie_mjp

最新推荐文章于 2021-04-22 23:08:15 发布

阅读量318

点赞数

分类专栏：图 POJ 数论线性规划最短路文章标签：图最短路数学相关差分约束

本文链接：https://blog.csdn.net/reverie_mjp/article/details/53121689

版权

图同时被 3 个专栏收录

45 篇文章 0 订阅

订阅专栏

POJ

43 篇文章 0 订阅

订阅专栏

数论

41 篇文章 0 订阅

订阅专栏

Intervals

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 25721		Accepted: 9843

Description

You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.
Write a program that:
reads the number of intervals, their end points and integers c1, ..., cn from the standard input,
computes the minimal size of a set Z of integers which has at least ci common elements with interval [ai, bi], for each i=1,2,...,n,
writes the answer to the standard output.

Input

The first line of the input contains an integer n (1 <= n <= 50000) -- the number of intervals. The following n lines describe the intervals. The (i+1)-th line of the input contains three integers ai, bi and ci separated by single spaces and such that 0 <= ai <= bi <= 50000 and 1 <= ci <= bi - ai+1.

Output

The output contains exactly one integer equal to the minimal size of set Z sharing at least ci elements with interval [ai, bi], for each i=1,2,...,n.

Sample Input

Sample Output

Source

Southwestern Europe 2002

[Submit] [Go Back] [Status] [Discuss]

Home Page Go Back To top

【题解】【差分约束】

【约束条件为 a[y+1]-a[x]>=c[i],a[x+1]-a[x]<=1,a[x+1]-a[x]>=0,全部转化为>=，跑最长路即可】

#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[500010],next[500010],p[50010],val[500010],tot;
int dis[500010],minn=0x7fffffff,maxn,ans,n;
bool b[500010];

inline void add(int x,int y,int z)
{
	tot++; a[tot]=y; next[tot]=p[x]; p[x]=tot; val[tot]=z;
	return ;
}
inline int spfa(int s,int t)
{
	memset(dis,-1,sizeof(dis));
	memset(b,true,sizeof(b));
	queue<int>que;
	que.push(s); b[s]=false; dis[s]=0;
	while (!que.empty())
	 {
	  int u,v;
	  u=que.front(); que.pop();
	  v=p[u]; b[u]=true;
	  while (v!=0)
	   {
	   	if (dis[a[v]]<dis[u]+val[v])
	     {
	   	  dis[a[v]]=dis[u]+val[v];
	   	  if (b[a[v]])
	   	    {
	   	 	  b[a[v]]=false;
	   	 	  que.push(a[v]);
			}
		   }	
	    v=next[v];
	   }
	 }
	return dis[t];
}
int main()
{
	int i,j;
	scanf("%d",&n);
	for (i=1;i<=n;++i)
	 {
	 	int x,y,z;
	 	scanf("%d%d%d",&x,&y,&z);
	 	minn=min(x,minn); maxn=max(y+1,maxn);
	 	add(x,y+1,z);
	 }
	for (i=minn;i<maxn;++i)
	 {add(i+1,i,-1); add(i,i+1,0);}
	ans=spfa(minn,maxn);
	printf("%d",ans);
	return 0;
}