Pagini recente » Cod sursa (job #224550) | Cod sursa (job #3199761) | Cod sursa (job #195793) | Cod sursa (job #2787212) | Cod sursa (job #3236831)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int64_t n, k, sp[50002], best = -(1 << 30), mini = (1 << 30);
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 + 1;
if(best < sp[i] - mini)
best = sp[i] - mini, st = st_, dr = i;
}
out<<st<<" "<<dr<<" "<<best;
return 0;
}