Cod sursa(job #325131)
| Utilizator | Data | 18 iunie 2009 23:33:50 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<stdlib.h>
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
long long a[50001],n,k,i,max=0,s=0,j;
long long x,y;
scanf("%lld %lld\n",&n,&k);
a[0]=0;
for(i=1;i<=n;i++)
{
scanf("%lld ",&a[i]);
a[i]=a[i]+a[i-1];
if(i>k) {
for(j=i-k;j>=0;j--)
{
s=a[i]-a[j];
if(s>max){max=s;
x=j+1;
y=i;}
}
}
if(i==k){max=a[i];
x=1;
y=i;}
}
printf("%lld %lld %lld\n",x,y,max);
return 0;
}
