题目大意:
有N(1<=N<=20,000)个站点的轻轨站,有一个容量为C(1<=C<=100)的列车起点在1号站点,终点在N号站点,有K(K<=50,000)组牛群,每组数量为M_i(1<=M_i<=N),行程起点和终点分别为S_i和E_i(1<=S_i<E_i<=N)
计算最多有多少头牛可以搭乘轻轨。
解题思路:
贪心+线段树维护
源程序:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 50001
#define M N<<2
#define leftson now*2
#define rightson now*2+1
using namespace std;
int maxn[M],last[M],left[M],right[M],n,m,c,ans;
struct node{
int l,r,n;
}a[N];
bool cmp(node x,node y){return x.r<y.r;}
void putd(int now)
{
if(last[now])
{
maxn[leftson]+=last[now];last[leftson]+=last[now];
maxn[rightson]+=last[now];last[rightson]+=last[now];
last[now]=0;
return;
}
}
void add(int now,int l,int r,int d)
{
if(left[now]>r||right[now]<l) return;
if(l<=left[now]&&right[now]<=r)
{
maxn[now]+=d;
last[now]+=d;
return;
}
putd(now);
add(leftson,l,r,d);
add(rightson,l,r,d);
maxn[now]=max(maxn[leftson],maxn[rightson]);
return;
}
int query(int now,int l,int r)
{
if(left[now]>r||right[now]<l) return 0;
if(l<=left[now]&&right[now]<=r) return maxn[now];
putd(now);
int t1=query(leftson,l,r),t2=query(rightson,l,r);
maxn[now]=max(maxn[leftson],maxn[rightson]);
return max(t1,t2);
}
void build(int now,int l,int r)
{
left[now]=l;right[now]=r;
if(l==r) return;
int mid=(l+r)>>1;
build(leftson,l,mid);build(rightson,mid+1,r);
}
int main()
{
scanf("%d%d%d",&n,&m,&c);
for(int i=1;i<=n;i++) scanf("%d%d%d",&a[i].l,&a[i].r,&a[i].n);
sort(a+1,a+1+n,cmp);
build(1,1,m);
for(int i=1,t;i<=n;i++)
{
int tot=query(1,a[i].l,a[i].r);
if(tot>=c) continue;
t=min(c-tot,a[i].n);
ans+=t;
add(1,a[i].l,a[i].r-1,t);
}
printf("%d",ans);
}