Pagini recente » Cod sursa (job #1739641) | Cod sursa (job #2092362) | Cod sursa (job #2784333) | Cod sursa (job #1552059) | Cod sursa (job #1375965)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,v[50001],sum,bestSum,beg,idx,sf,r;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
}
r=0;
for(i=1;i<=n;++i)
{
if (sum<0)
{
sum = v[i];
idx = i;
r=1;
}
else
{
sum += v[i];
r++;
}
if (r>=k and bestSum < sum)
{
bestSum = sum;
beg = idx;
sf = i;
}
}
g<<beg<<" "<<sf<<" "<<bestSum;
return 0;
}