首页 > 代码库 > CodeForces 709A Juicer
CodeForces 709A Juicer
简单题。
#pragma comment(linker, "/STACK:1024000000,1024000000")#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<iostream>using namespace std;typedef long long LL;const double pi=acos(-1.0),eps=1e-6;void File(){ freopen("D:\\in.txt","r",stdin); freopen("D:\\out.txt","w",stdout);}template <class T>inline void read(T &x){ char c = getchar(); x = 0;while(!isdigit(c)) c = getchar(); while(isdigit(c)) { x = x * 10 + c - ‘0‘; c = getchar(); }}const int maxn=100010;int a[maxn],b,n,d;int main(){ scanf("%d%d%d",&n,&b,&d); for(int i=1;i<=n;i++) scanf("%d",&a[i]); int ans=0,sum=0; for(int i=1;i<=n;i++) { if(a[i]>b) continue; sum=sum+a[i]; if(sum>d) ans++,sum=0; } printf("%d\n",ans); return 0;}
CodeForces 709A Juicer
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。