Pagini recente » Cod sursa (job #626602) | Cod sursa (job #540798) | Cod sursa (job #339298) | Cod sursa (job #609222) | Cod sursa (job #2451973)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, s[50005], sMax, in, sf, k;
int main() {
f >> n >> k;
for(int i = 1; i <= n; i++) {
f >> s[i];
s[i] += s[i-1];
}
sMax = s[k], in = 1, sf = k;
int minim = 0, inceput = 0;
for(int i = k+1; i <= n; i++) {
if(s[i-k] < minim) {
minim = s[i-k];
inceput = i-k+1;
}
if(s[i]- minim > sMax) {
sMax = s[i]-minim;
in = inceput;
sf = i;
}
}
g << in << ' ' << sf << ' ' << sMax;
}