Cod sursa(job #1321437)
| Utilizator | Data | 19 ianuarie 2015 09:30:16 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <cstdio>
#define MAXN 50100
int s[MAXN], n, k, maxim, pin, pout;
void citire()
{
int i, x;
scanf("%d%d", &n, &k);
for(i=1;i<=n;++i)
{
scanf("%d", &x);
s[i]=s[i-1]+x;
}
}
void rezolva_problema()
{
int i,j;
citire();
s[0]=0; maxim=0;
for(i=1;i<=n-k;++i)
{
for(j=i+k;j<=n;++j)
if(s[j]-s[i]>maxim)
{
maxim=s[j]-s[i-1];
pin=i;
pout=j;
}
}
printf("%d %d %d\n", pin, pout, maxim);
}
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
rezolva_problema();
return 0;
}
