Pagini recente » Cod sursa (job #1643294) | Cod sursa (job #300412) | Cod sursa (job #2850369) | Cod sursa (job #1081226) | Cod sursa (job #354610)
Cod sursa(job #354610)
#include<stdio.h>
int n,k,i,u,d,v[50001];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++){scanf("%d",&v[i]);v[i]+=v[i-1];}
}
void solve()
{
if(k==n){printf("1 %d %d\n",n,v[n]);return;}
u=k; for(i=k;i<=n;i++)u=v[i]>v[u]?i:u;
d=u-k+1;for(i=d;i>=0;i--)d=v[i]<v[d]?i:d;
printf("%d %d %d\n",d+1,u,v[u]-v[d]);
}