Cod sursa(job #2073300)
Utilizator | Data | 22 noiembrie 2017 22:05:43 | |
---|---|---|---|
Problema | Trapez | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
using namespace std;
int main()
{
int n,nrmax;
int s[100005]={};
cin>>n>>nrmax;s[0]=0;int i,x;
for(i=1;i<=n;++i) {cin>>x;s[i]=s[i-1]+x;}
int j=1,Max=0;
for(i=0;i<n;++i)
{
while(j<=n && s[j]-s[i]<=nrmax) ++j;
Max=max(j-i-1,Max);
}
cout<<Max<<'\n';
return 0;
}