Cod sursa(job #1468974)
Utilizator | Data | 7 august 2015 13:44:25 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>#include<algorithm>
int v[50001];
int main()
{
int n,k,i,p,u;
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];
}
for(i=k,u=k; i<=n; ++i)if(v[i]>v[u])u=i;
for(i=u-k,p=u-k; i>=0; --i)if(v[i]<v[p])p=i;
printf("%d %d %d\n",p+1,u,v[u]-v[p]);
return 0;
}