Pagini recente » Cod sursa (job #909643) | Cod sursa (job #3356934) | Cod sursa (job #1360765) | Cod sursa (job #3340228) | Cod sursa (job #3316095)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main() {
int n, k;
fin >> n >> k;
int v[500001];
for (int i = 1; i <= n; ++i)
fin >> v[i];
long long suma = 0;
for (int i = 1; i <= k; ++i)
suma += v[i];
long long maxSuma = suma;
int poz = 1;
for (int i = k + 1; i <= n; ++i) {
suma = suma - v[i - k] + v[i];
if (suma > maxSuma) {
maxSuma = suma;
poz = i - k + 1;
}
}
for (int i = poz; i < poz + k; ++i)
fout << v[i] << " ";
return 0;
}