Pagini recente » Cod sursa (job #1449761) | Cod sursa (job #1900338) | Monitorul de evaluare | Cod sursa (job #1176396) | Cod sursa (job #1094328)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int V[50001], S[50001];
int main()
{
int n,k,i,Smin,Su,dr,st,first;
in >> n >> k;
for(i = 1; i <=n ; i++)
in >> V[i];
S[0] = 0;
Smin=25000;
Su=-25000;
for(i = 1; i <= n; i++)
S[i] = S[i-1] + V[i];
for(i = k; i <= n; i++)
{
if (Smin > S[i-k]) {
Smin = S[i-k];
first = i - k + 1;
}
if(S[i] - Smin > Su)
{
Su = S[i] - Smin;
dr = i;
st = first;
}
}
out << st << " " << dr << " " << Su;
in.close();
out.close();
return 0;
}