Cod sursa(job #3236830)
| Utilizator | Data | 2 iulie 2024 17:49:06 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int64_t n, k, sp[50002], best, mini = (1ll << 60);
int64_t sMax = 0, st, dr, st_;
int main(){
in>>n>>k;
for(int i = 1; i <= n; i++)
in>>sp[i], sp[i] += sp[i - 1];
best = sp[k];
for(int i = k; i <= n; i++){
if(mini > sp[i - k])
mini = sp[i - k], st_ = i - k;
if(best < sp[i] - mini)
best = sp[i] - mini, st = st_, dr = i;
}
out<<st + 1<<" "<<dr<<" "<<best;
return 0;
}
