Pagini recente » Cod sursa (job #2976283) | Cod sursa (job #2463697) | Cod sursa (job #195298) | Cod sursa (job #2567464) | Cod sursa (job #871735)
Cod sursa(job #871735)
#include<fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int S[50005], n;
int main()
{
int bestSum = -2000000000, min = 2000000000, idx, beg, end, i, k;
cin>>n>>k;
for(i=1;i<=n;i++)
{cin>>S[i];
S[i]=S[i]+S[i-1];}
for(i=k;i<=n;i++){
if (bestSum < S[i] - min)
bestSum = S[i] - min, beg = idx, end = i;
if (min > S[i-k])
min = S[i-k], idx = i-k+1;
}
cout << beg << " " << end<<" "<<bestSum <<"\n";
return 0;
}