Pagini recente » Cod sursa (job #760110) | Cod sursa (job #3295602) | Cod sursa (job #2712258) | Cod sursa (job #1343572) | Cod sursa (job #2906390)
#include <iostream>
#include <fstream>
using namespace std;
int n, z, v[1001], actS = 0, maxS = -1, pos = 0, first, last, close;
int main() {
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
fin >> n >> z;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
for (int k = i; k <= j; ++k) {
actS = actS + v[k];
++pos;
}
if (actS > maxS && pos >= z) {
maxS = actS;
first = i, last = j;
}
actS = 0;
pos = 0;
}
}
if (maxS != -1) {
fout << first << ' ' << last << ' ' << maxS;
}
return 0;
}