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<