[ An Ac a Day ^_^ ] CodeForces 677B Vanya and Food Processor 模拟

 1 #include<stdio.h>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<math.h>
 5 #include<string.h>
 6 #include<string>
 7 #include<map>
 8 #include<set>
 9 #include<vector>
10 #include<queue>
11 #define M(a,b) memset(a,b,sizeof(a))
12 using namespace std;
13 typedef long long ll;
14 int potato[100005];
15 int main(){
16     int n,h,k;
17     scanf("%d%d%d",&n,&h,&k);
18     for(int i=0;i<n;i++)
19         scanf("%d",&potato[i]);
20     ll ans=0,high=0;
21     for(int i=0;i<n;i++){
22         if(high+potato[i]<=h) high+=potato[i]; //能放下就放上去
23         else{  //放不下就打完了再放
24             high=potato[i]; 
25             ans++;
26         }
27         ans+=high/k;
28         high%=k;
29     }
30     if(high) ans++; //最后剩一点还要处理一下
31     printf("%I64d\n",ans);
32     return 0;
33 }
34 /*
35 
36 5 6 3
37 5 4 3 2 1
38 
39 5 6 3
40 5 5 5 5 5
41 
42 5 6 3
43 1 2 1 1 1
44 
45 */