Cod sursa(job #932250)
Utilizator | Data | 28 martie 2013 19:51:52 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.77 kb |
# include <cstdio>
# include <algorithm>
using namespace std;
int s[50001];
int i,j,n,p,u,P,k,U,maxx,minn;
int main ()
{
freopen ("secv2.in", "r", stdin);
freopen ("secv2.out", "w", stdout);
scanf ("%d%d", &n, &k);
for (i=1; i<=n; ++i)
{
scanf ("%d", &s[i]);
s[i]+=s[i-1];
}
minn=20000000;
maxx=-20000000;
for (i=k; i<=n; ++i)
{
if (s[i-k]<minn)
{
minn=s[i-k];
p=i-k+1;
}
if (s[i]-minn>maxx) {
maxx=s[i]-minn;
U=i;
P=p;
}
}
printf ("%d %d %d\n", P, U, maxx);
return 0;
}