Cod sursa(job #3286471)
| Utilizator | Data | 14 martie 2025 11:35:39 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, k;
long long a[50001], sp[50001];
long long s, sultim, maxim = -100000000000000, st, dr;
int main(){
f >> n >> k;
int poz = 1;
for (int i = 1; i <= n; i++){
f >> a[i];
if(s < sultim) {
s = sultim;
poz = i - k + 1;
}
s += a[i];
sultim += a[i];
if(i - k + 1 >= 1) {
sultim -= a[i - k + 1];
}
if(s > maxim && i >= k) {
maxim = s;
st = i;
dr = poz;
}
}
g << dr << " " << st <<" " << maxim;}
