NOIP2011.day2.观光公交 题解

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;

const int maxn=1005,maxm=10005;
int n,m,k,ans;
int d[maxn],bt[maxm],e[maxm],v[maxn],last[maxn]={0},t[maxn]={0},reduce[maxn]={0};

void work(int p)
{
	for (int i=p;i<n;i++)
	  t[i]=max(last[i],t[i-1])+d[i];
}

int main()
{
	
	scanf("%d%d%d",&n,&m,&k);
	
	for (int i=1;i<n;i++)
	  scanf("%d",&d[i]);
	int tmp,x,y;
	for (int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&tmp,&x,&y);
		bt[i]=tmp;
		e[i]=y;
		v[y]++;
		last[x]=max(last[x],tmp);
    }
		
	t[0]=last[1];
	work(1);
	ans=0;	
	for (int i=1;i<=m;i++)
		ans+=t[e[i]-1]-bt[i];	
	
	for (int i=1;i<=k;i++)
	{
		int maxt=0,p=-1;
		for (int j=n-1;j>=1;j--)
		{
			if (t[j]>last[j+1])
			    reduce[j]=reduce[j+1]+v[j+1];
			else
			    reduce[j]=v[j+1];
			if ((reduce[j]>maxt)&&(d[j]>0))
			{
				maxt=reduce[j];
				p=j;
			}
		}
	    
	    
	    if (p==-1) break;
	    
	    if (ans>maxt)
	    {
	    	d[p]--;ans-=maxt;
	    }
	    else
	    {
	    	ans=0;break;
	    }
	    
	    work(p);