Cod sursa(job #1268785)
| Utilizator | Data | 21 noiembrie 2014 14:53:23 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int a[50000],i,j,k,n,s[50000],mmax,p,u;
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",&a[i]);
s[i]=s[i-1]+a[i];
}
mmax=s[k];
p=1;
u=k;
for(i=k+1;i<=n;i++)
{
for(j=0;j<=i-k;j++)
if(mmax<s[i]-s[j])
{
mmax=s[i]-s[j];
p=j+1;
u=i;
}
}
printf("%d %d %d",p,u,mmax);
return 0;
}
