Cod sursa(job #1599711)
| Utilizator | Data | 14 februarie 2016 11:43:16 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[50002],s[50002],i,v,inc,dr,st,rez;
long long n,k;
int main()
{ f>>n>>k;
for(i=1;i<=n;i++)
{ f>>a[i];
s[i]=s[i-1]+a[i];
}
rez=s[k];
inc=1;
dr=k;
st=1;
v=s[k];
for(i=k+1;i<=n;i++)
{v=v+a[i];
if(v<=s[i]-s[i-k])
{v=s[i]-s[i-k];
inc=i-k+1;
}
if(rez<v)
{ rez=v;
st=inc;
dr=i;
}
}
g<<st<<' '<<dr<<' '<<rez;
return 0;
}
