ural 1998

Yoda: Use the Force. Yes. Now, the stone. Feel it. Concentrate!              http://blog.csdn.net/u011032846/article/details/13505053

Luke Skywalker is having exhausting practice at a God-forsaken planet Dagoba. One of his main difficulties is navigating cumbersome objects using the Power. Luke’s task is to hold several stones in the air simultaneously. It takes complete concentration and attentiveness but the fellow keeps getting distracted.

Luke chose a certain order of stones and he lifts them, one by one, strictly following the order. Each second Luke raises a stone in the air. However, if he gets distracted during this second, he cannot lift the stone. Moreover, he drops some stones he had picked before. The stones fall in the order that is reverse to the order they were raised. They fall until the total weight of the fallen stones exceeds  k kilograms or there are no more stones to fall down.

The task is considered complete at the moment when Luke gets all of the stones in the air. Luke is good at divination and he can foresee all moments he will get distracted at. Now he wants to understand how much time he is going to need to complete the exercise and move on.

Input:

  The  first line contains three integers:  n  is the total number of stones,  m  is the number of moments when Luke gets distracted and  k  (1 ≤  n ,  m  ≤ 10  ⁵ , 1 ≤  k  ≤ 10  ⁹ ). Next  n  lines contain the stones’ weights  w _i  (in kilograms) in the order Luke is going to raise them (1 ≤  w _i  ≤ 10  ⁴ ). Next  m lines contain moments  t _i , when Luke gets distracted by some events (1 ≤  t _i  ≤ 10  ⁹ ,  t _i  <  t _i+1 ).

Output:

Print a single integer — the number of seconds young Skywalker needs to complete the exercise.

5 1 4                                    8
1
2                      
3
4
5
4

1. #include <iostream>  
2. #include <cstring>  
3. #include <string>  
4. #include <cstdio>  
5. #include <cmath>  
6. #include <algorithm>  
7. #include <vector>  
8. #include <queue>  
9. #include <map>  
10. #define inf 0x3f3f3f3f  
11. typedef __int64 ll;  
12. using namespace std;  
13.   
14. int c[100005],w[100005],s[100005],t[100005],tmp,N,n,m,k,i,cnt,pos,ans;  
15.   
16. int main()  
17. {  
18.     while(~scanf("%d%d%d",&n,&m,&k))  
19.     {  
20.         for(i=1;i<=n;i++)  
21.             scanf("%d",&w[i]);  
22.         for(i=1;i<=m;i++)  
23.             scanf("%d",&t[i]);  
24.         s[n]=w[n];  
25.         tmp=n-1;  
26.         cnt=1;  
27.         while(s[n]<=k&&tmp>0)  
28.         {  
29.             s[n]+=w[tmp];  
30.             tmp--;  
31.             cnt++;  
32.         }  
33.         c[n]=cnt;  
34.         N=n-1;  
35.         while(N)  
36.         {  
37.             s[N]=s[N+1]-w[N+1];  
38.             cnt--;  
39.             while(s[N]<=k&&tmp>0)  
40.             {  
41.                 s[N]+=w[tmp];  
42.                 tmp--;  
43.                 cnt++;  
44.             }  
45.             c[N]=cnt;  
46.            // printf("N:%d cnt:%d tmp:%d\n",N,cnt,tmp);  
47.             if(tmp<=0)  
48.             {  
49.                 for(i=N;i>0;i--)  
50.                 {  
51.                     c[i]=i;  
52.                 }  
53.                 break;  
54.             }  
55.             N--;  
56.         }  
57.         //处理每一个分散注意力的秒  
58.         sort(t+1,t+m+1);  
59.         t[0]=0;  
60.         ans=0;  
61.         pos=0;  
62.         for(i=1;i<=m;i++)  
63.         {  
64.             tmp=(t[i]-t[i-1]);  
65.             pos+=tmp;  
66.             if(pos>n){//时间超出了全部拿完的时间  
67.                 pos-=tmp;  
68.                 break;  
69.             }  
70.             ans+=tmp;  
71.             pos=pos-1-c[pos-1];  
72.   
73.         }  
74.         ans+=(n-pos);  
75.         printf("%d\n",ans);  
76.     }  
77.     return 0;  
78. }