Pagini recente » Cod sursa (job #45283) | Cod sursa (job #3218228) | Cod sursa (job #492681) | Cod sursa (job #237086) | Cod sursa (job #2393678)
#include <iostream>
#include<fstream>
#include<string>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,k;
short a[50000];
void read()
{
in>>n>>k;
for(int i=0; i<n; i++)
{
in>>a[i];
}
}
int maxsum()
{
int i1=0,maxi1,maxi2;
int sum=0,maxsum=-999999999;
for(int i=0; i<n; i++)
{
if(n-i>=k&&sum+a[i]<a[i])
{
i1=i;
cout<<i<<'/n';
sum=a[i];
}
else
{
sum+=a[i];
}
if(i-i1+1>=k &&sum>=maxsum)
{
maxsum=sum;
maxi1=i1;
maxi2=i;
}
}
out<<maxi1+1<<" "<<maxi2+1<<" "<<maxsum;
}
int main()
{
read();
maxsum();
return 0;
}