Pagini recente » Cod sursa (job #1747332) | Cod sursa (job #1534356) | Cod sursa (job #1597618) | Cod sursa (job #1502473) | Cod sursa (job #2451957)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, sMax = -int(2e9), in, sf, k;
int maxim(int a, int b) {
if(a > b)
return a;
return b;
}
void sumMax() {
int s = 0, sum = 0, index = 0;
for(int i = 1; i <= n; i++) {
f >> s;
if(sum < 0) {
sum = s, index = i;
} else
sum += s;
if(sum > sMax && i - index+1 >= k) {
sMax = sum;
sf = i;
in = index;
}
}
}
int main() {
f >> n >> k;
sumMax();
g << in << ' ' << sf << ' ' << sMax;
}