Cod sursa(job #1829628)
Utilizator | Susciuc Anastasia Anastasia11 | Data | 15 decembrie 2016 14:38:00 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream>
using namespace std;
int a[1009],n,i,smax,pmax,j,s,l,max1=-21000000,p,suma,i1,st,dr;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>l;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{p=a[i];
if(suma>=0)
suma=suma+p;
else
{
i1=i;
suma=p;
}
if(suma>=max1)
{
max1=suma;
st=i1;
dr=i;
}
}
if(dr-st>l)
g<<st<<" "<<dr<<" ";
for(i=st;i<=dr;i++)
s=s+a[i];
g<<s;
}