Pagini recente » Istoria paginii runda/infinity-2022-10 | Cod sursa (job #2704847) | Cod sursa (job #1696589) | Cod sursa (job #890774) | Cod sursa (job #160556)
Cod sursa(job #160556)
#include<stdio.h>
#include<values.h>
int main(){
freopen ("secv2.in","r",stdin);
freopen ("secv2.out","w",stdout);
long N,K;
long a[50001];
scanf ("%ld%ld",&N,&K);
for (long i=0;i<N;i++)
scanf("%ld",&a[i]);
int max=-MAXINT;
long x,q;
long S=0;
if (K==N){
long P=0;
for (long t=0;t<N;t++)
P+=a[t];
printf ("1 %d %d",N,P);
}
else{
for (long j=0;j<N-K;j++){
S=0;
if(a[j]>a[j-1]){
for (long y=j;y<j+K;y++)
S+=a[y];
if (S>max){
max=S;
x=j;
q=j+K-1;}
for (long u=j+K;u<N;u++){
S+=a[u];
if (S>max){
max=S;
x=j;
q=u;}} }}
printf ("%d %d %d",x+1,q+1,max);
}
fclose(stdin);
fclose(stdout);
return 0;
}