Pagini recente » Cod sursa (job #1565624) | Cod sursa (job #453064) | Cod sursa (job #1013553) | Cod sursa (job #883546) | Cod sursa (job #1780184)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long n,k,i,a,d,s1,minim,maxim,st,dr,s[50002];
int main()
{
fin >> n >> k;
for(i=1;i<=k;i++)
{
fin >> a;
s[i]=s[i-1]+a;
}
if(k==n)
{
fout << "1 " << n << " " << s[k] << "\n";
return 0;
}
for(i=1;i+k<=n;i++)
{
fin >> a;
d=i+k;
s[d]=s[d-1]+a;
if(s[i]<minim)
{
minim=s[i];
s1=i;
}
if(s[d]-minim>maxim)
{
maxim=s[d]-minim;
st=s1+1;
dr=i+k;
}
}
fout << st << " " << dr << " " << maxim << "\n";
return 0;
}