Pagini recente » Cod sursa (job #50419) | Cod sursa (job #2794348) | Cod sursa (job #1571419) | Cod sursa (job #1543838) | Cod sursa (job #983540)
Cod sursa(job #983540)
#include<fstream>
using namespace std;
ifstream f("secv2.in"); ofstream g("secv2.out");
const int MAX = 50005;
const int fF = 0x3f3f3f3f;
int N, K, mfim, best = -fF, start, stop, pozMfim, S[MAX];
int main()
{ f >> N >> K;
for(int i = 1, X; i <= N; i++)
{ f >> X;
S[i] = S[i - 1] + X;
if(i >= K)
{
if(mfim > S[i - K]) {mfim = S[i - K]; pozMfim = i - K;}
if(S[i] - mfim > best) {best = S[i] - mfim; start = pozMfim + 1; stop = i;}
}
}
g << start << " " << stop << " " << best << "\n";
g.close(); return 0;
}