Pagini recente » Cod sursa (job #1794428) | Cod sursa (job #2493789) | dot-com/2012/clasament/runda-1 | Cod sursa (job #2328979) | Cod sursa (job #1893367)
#include <bits/stdc++.h>
#define nmax 50003
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, K;
int i;
int S[nmax], mi[nmax], poz[nmax];
int sol = INT_MIN;
int st, dr;
int main()
{
fin >> n >> K;
for(i = 1; i <= n; i++)
{
fin >> S[i];
S[i] += S[i - 1];
if(S[i] < mi[i - 1])
{
poz[i] = i;
mi[i] = S[i];
}
else mi[i] = mi[i - 1], poz[i] = poz[i - 1];
if(i >= K)
{
if(sol < S[i] - mi[i - K])
{
sol = S[i] - mi[i - K];
st = poz[i - K];
dr = i;
}
}
}
fout << st + 1 << " " << dr << " " << sol << "\n";
return 0;
}