Cleaning Shifts POJ - 2376

Cleaning Shifts POJ - 2376
这题可以用线段树加dp

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
int n,m,p,x,y,ans;
int t;
struct node
{
	int l,r,w;
}tree[4000001];
inline void build(int l,int r,int k)
{
	tree[k].l=l;tree[k].r=r;
	if(l==r) 
	{
		tree[k].w = n+1;
		return;
	}
	int m=(l+r)/2;
	build(l,m,k*2);
	build(m+1,r,k*2+1);
	tree[k].w=min(tree[k*2].w,tree[k*2+1].w);
}
inline void hcl(int k,int op,int pos)
{
	if(tree[k].l==tree[k].r)
	{
		tree[k].w = op;
		return;
	}
	int m=(tree[k].l+tree[k].r)/2;
	if(pos<=m) hcl(k*2,op,pos);
	else hcl(k*2+1,op,pos);
	tree[k].w=min(tree[k*2].w,tree[k*2+1].w); 
}
inline void minx(int l,int r,int k)
{
	if(l<=tree[k].l&&tree[k].r<=r) 
	{
		ans = min(ans,tree[k].w);
		return;
	}
	int m=(tree[k].l+tree[k].r)/2;
	if(l<=m) minx(l, r, k*2);
	if(r>m) minx(l, r, k*2+1);
}
struct line{
	int l,r;
}a[50005];
int dp[1000005];
bool cmp(line a,line b)
{
	if(a.l==b.r)
		return a.r < b.r;
	else
		return a.l < b.l;
}
int main()
{
	while(~scanf("%d %d",&n,&t))
	{
		memset(dp,0x3f3f3f3f,sizeof(dp));
		build(1,t,1);
		for(int i=1;i<=n;i++)
		{
			scanf("%d %d",&a[i].l,&a[i].r);
			a[i].r = min(a[i].r ,t);
		}
		sort(a+1,a+1+n,cmp);
		for(int i = 1;i<=n;i++)
		{
			if(a[i].l>a[i].r)
				continue;
			if(a[i].l>t)
				break;
			ans = 0;
			if(a[i].l==1)
				dp[a[i].r] = 1;
			else
			{
				ans = n+1;
				minx(a[i].l-1,a[i].r,1);
				dp[a[i].r] = min(dp[a[i].r],ans+1);
			}
			hcl(1,dp[a[i].r],a[i].r);
		}
		if(dp[t]>n)
			printf("-1\n");
		else
			printf("%d\n",dp[t]);
	}
}