Pagini recente » Cod sursa (job #405395) | Cod sursa (job #378970) | Cod sursa (job #1486283) | Cod sursa (job #670051) | Cod sursa (job #2815351)
#include <fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
long long n1,n,k,v[50001],j,i,maxi=-9999999,s,d,maxi1=-9999999;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>n1;
v[i]=v[i-1]+n1;
}
for(i=k;i<=n;i++)
{
if(v[i]>maxi)
{
maxi=v[i];
d=i;
}
}
for(i=0;i<=n-k;i++)
{
if(v[i+k-1]==maxi)
{
maxi=-99999999;
for(j=i+k;j<=n;j++)
{
if(v[j]>maxi)
{
maxi=v[j];
d=j;
}
}
}
if(maxi-v[i]>maxi1)
{
maxi1=maxi-v[i];
s=i;
}
}
cout<<s+1<<" "<<d-1<<" "<<maxi1;
return 0;
}