Pagini recente » Cod sursa (job #1453561) | Cod sursa (job #1162667) | Istoria paginii propuneri/14-grupuri-probleme | Cod sursa (job #1395238) | Cod sursa (job #871747)
Cod sursa(job #871747)
#include<fstream>
#include<limits.h>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int S[50005], n;
int main()
{
int bestSum = INT_MIN, min = INT_MAX, 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;
}