Cod sursa(job #1953495)
| Utilizator | Data | 4 aprilie 2017 21:01:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fin("efort.in");
ofstream fout("efort.out");
int v[201];
int main()
{
long long int n,a,b,c,k,i,total=0,p,j;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for (i=1; i<=n; i++)
{
p=v[i];
while(p<k && i<=n)
{
i++;
p=p+v[i];
}
total=total+k;
a=1;
b=1;
c=a+b;
for(j=1;j<=p-k;j++)
{
total=total+c;
a=b;
b=c;
c=a+b;
}
}
fout<<total;
return 0;
}
