题目链接：http://codeforces.com/contest/677/problem/B
题意：n个土豆，每个土豆高ai。现在有个加工机，最高能放h，每次能加工k。问需要多少次才能把土豆全加工完。
模拟就行了，加工次数用相除的结果，一个一个来会TLE
1 /* 2 ━━━━━┒ギリギリ♂ eye！ 3 ┓┏┓┏┓┃キリキリ♂ mind！ 4 ┛┗┛┗┛┃＼○／ 5 ┓┏┓┏┓┃ / 6 ┛┗┛┗┛┃ノ) 7 ┓┏┓┏┓┃ 8 ┛┗┛┗┛┃ 9 ┓┏┓┏┓┃ 10 ┛┗┛┗┛┃ 11 ┓┏┓┏┓┃ 12 ┛┗┛┗┛┃ 13 ┓┏┓┏┓┃ 14 ┃┃┃┃┃┃ 15 ┻┻┻┻┻┻ 16 */ 17 #include <algorithm> 18 #include <iostream> 19 #include <iomanip> 20 #include <cstring> 21 #include <climits> 22 #include <complex> 23 #include <fstream> 24 #include <cassert> 25 #include <cstdio> 26 #include <bitset> 27 #include <vector> 28 #include <deque> 29 #include <queue> 30 #include <stack> 31 #include <ctime> 32 #include <set> 33 #include <map> 34 #include <cmath> 35 using namespace std; 36 #define fr first 37 #define sc second 38 #define cl clear 39 #define BUG puts("here!!!") 40 #define W(a) while(a--) 41 #define pb(a) push_back(a) 42 #define Rlf(a) scanf("%lf", &a); 43 #define Rint(a) scanf("%d", &a) 44 #define Rll(a) scanf("%I64d", &a) 45 #define Rs(a) scanf("%s", a) 46 #define Cin(a) cin >> a 47 #define FRead() freopen("in", "r", stdin) 48 #define FWrite() freopen("out", "w", stdout) 49 #define Rep(i, len) for(int i = 0; i < (len); i++) 50 #define For(i, a, len) for(int i = (a); i < (len); i++) 51 #define Cls(a) memset((a), 0, sizeof(a)) 52 #define Clr(a, x) memset((a), (x), sizeof(a)) 53 #define Full(a) memset((a), 0x7f7f, sizeof(a)) 54 #define lrt rt << 1 55 #define rrt rt << 1 | 1 56 #define pi 3.14159265359 57 #define RT return 58 #define lowbit(x) x & (-x) 59 #define onenum(x) __builtin_popcount(x) 60 typedef long long LL; 61 typedef long double LD; 62 typedef unsigned long long ULL; 63 typedef pair<int, int> pii; 64 typedef pair<string, int> psi; 65 typedef map<string, int> msi; 66 typedef vector<int> vi; 67 typedef vector<LL> vl; 68 typedef vector<vl> vvl; 69 typedef vector<bool> vb; 70 71 const int maxn = 100100; 72 int n, h, k; 73 int a[maxn]; 74 75 int main() { 76 // FRead(); 77 while(~scanf("%d%d%d",&n,&h,&k)) { 78 For(i, 1, n+1) Rint(a[i]); 79 LL ret = 0; 80 int i = 1; 81 LL tmp = 0; 82 while(i <= n) { 83 while(i <= n && tmp + a[i] <= h) tmp += a[i++]; 84 if(tmp < k) { 85 ret++; 86 tmp = 0; 87 } 88 else { 89 ret += tmp / k; 90 tmp %= k; 91 } 92 } 93 if(tmp > 0) ret++; 94 cout << ret << endl; 95 } 96 RT 0; 97 }