Cod sursa(job #1268799)
| Utilizator | Data | 21 noiembrie 2014 15:07:37 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <cstdio>
using namespace std;
int a[50001],i,j,k,n,s[50001],mmax,p,u;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
mmax=-1250000000;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s[i]=s[i-1]+a[i];
if(s[i]>=mmax)
{
mmax=s[i];
p=1;
u=i;
}
}
for(i=1;i<=u-k;i++)
{
if(mmax<=s[u]-s[i])
{
mmax=s[u]-s[i];
p=i+1;
}
}
printf("%d %d %d",p,u,mmax);
return 0;
}
