Cod sursa(job #1374994)
| Utilizator | Data | 5 martie 2015 11:39:54 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("secv.in");
ofstream out("secv.out");
int n,i,j,s ;
in >> n >> s ;
int v[n+1] ;
for (i=1;i<=n;i++) in >> v[i] ;
int a[n+1];
int lungime=0,s2=0,maxim ;
//int k = 1;
for (i=1;i<=n;i++)
{
for (j=i+1;j<=n;j++)
{
if (s2 + v[j] <= s) {s2+= v[j]; lungime++;}
else {a[i] = lungime ;j = n ; lungime = 0 ; s2 = 0;};
//cout<<k<<'\n';
}
}
for (i=1;i<=n;i++) cout<<a[i]<<" " ;
return 0;
}
