Pagini recente » Cod sursa (job #2376922) | Cod sursa (job #340001) | Cod sursa (job #188603) | Cod sursa (job #560343) | Cod sursa (job #1753701)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long a[50001],sum[50001];
int main()
{
long long n,i,t,maxx=-125000000000,firstmax,lastmax,j;
fin>>n>>t;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];
for(i=t;i<=n;i++)
for(j=1;j<=i-t;j++)
{
if(sum[i]-sum[j]>maxx)
{
maxx=sum[i]-sum[j];
firstmax=j;
lastmax=i;
}
}
/*for(i=1;i<=n;i++)
{
if(s+a[i]<a[i])
{
s=a[i];
first=i;
last=i;
k=1;
}
else
{
s+=a[i];
last=i;
k++;
}
if(s>maxx && k>=t)
{
maxx=s;
firstmax=first;
lastmax=last;
}
}
if(maxx==-125000000000)
for(i=1;i<=n;i++)
sum[i]=sum[i-1]+a[i];
for(i=t;i<=n;i++)
if(sum[i]-sum[i-t]>maxx)
{
maxx=sum[i]-sum[i-t];
firstmax=i-t+1;
lastmax=i;
}*/
fout<<firstmax<<" "<<lastmax<<" "<<maxx;
return 0;
}