标签：
题意：给定 n 个桔子的大小，一个杯子的容积，一个最大限度，挨着挤桔子汁，如果大小大于限度，扔掉，如果不杯子满了倒掉，问你要倒掉多少杯。
析：直接按要求模拟就好，满了就清空杯子。
代码如下：
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 1e5 + 5;
const int mod = 1e8;
const char *mark = "+-*";
const int dr[] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int dc[] = {0, 1, 0, -1, -1, 1, 1, -1};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
return r >= 0 && r < n && c >= 0 && c < m;
}
int main(){
LL b, d;
cin >> n >> b >> d;
LL x, sum = 0;
int ans = 0;
for(int i = 0; i < n; ++i){
cin >> x;
if(x > b) continue;
sum += x;
if(sum > d) sum = 0, ++ans;
}
cout << ans << endl;
return 0;
}
CodeForces 709A Juicer (水题， 模拟)
标签：
原文地址：http://www.cnblogs.com/dwtfukgv/p/5808809.html
