Cod sursa(job #2699915)
| Utilizator | Data | 26 ianuarie 2021 10:33:27 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
using ll = long long;
int main()
{
ifstream cin("secv2.in");
ofstream cout("secv2.out");
ll n, k;
cin >> n >> k;
ll v[100001], sp[100001];
for(int i = 1; i <= n; ++i)
{
cin >> v[i];
sp[i] = sp[i - 1] + v[i];
}
int st = 0, dr = 0, smax = 0;
for(int i = k; i <= n; ++i)
{
if(sp[i] - sp[i - k] > smax)
smax = sp[i] - sp[i - k], st = i - k + 1, dr = i;
}
for(int i = st; i <= dr; ++i)
cout << v[i] << " ";
return 0;
}
