Pagini recente » Cod sursa (job #141850) | Cod sursa (job #2417642) | Cod sursa (job #2442657) | Cod sursa (job #2610178) | Cod sursa (job #2393641)
#include <iostream>
#include<fstream>
#include<string>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,k,a[6000000];
void read()
{
in>>n>>k;
for(int i=0; i<n; i++)
{
in>>a[i];
}
}
int maxsum()
{
int i1=0,i2=0,maxi1,maxi2;
int sum=0,maxsum=-999999999;
for(int i=0; i<n; i++)
{
if(i-i1+1>=k&&sum+a[i]<a[i])
{
i1=i;
i2=i;
sum=a[i];
}
else
{
sum+=a[i];
i2=i;
}
if(sum>=maxsum)
{
if(maxsum==sum)
{
if(maxi2-maxi1+1>i2-i1+1)
{
maxsum=sum;
maxi1=i1;
maxi2=i2;
}
}
else
{
maxsum=sum;
maxi1=i1;
maxi2=i2;
}
}
}
out<<maxi1+1<<" "<<maxi2+1<<" "<<maxsum;
}
int main()
{
read();
maxsum();
return 0;
}