Pagini recente » Cod sursa (job #1701036) | Cod sursa (job #2953962) | Cod sursa (job #2205820) | Cod sursa (job #1005551) | Cod sursa (job #3309382)
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
const int NMAX = 5e4;
int v[NMAX + 1];
long long sum[NMAX + 1];
int main(){
int n, k;
fin >> n >> k;
for (int i = 1; i <= n; i++){
fin >> v[i];
sum[i] = sum[i - 1] + v[i];
}
long long rez = -25001, summin = 0;
int dr = k, st = 1, j = 0;
for (int i = k; i <= n; i++){
long long s = sum[i] - summin;
if (s > rez){
st = j + 1;
dr = i;
rez = s;
}
if (sum[i - k + 1] < summin){
summin = sum[i - k + 1];
j = i - k + 1;
}
}
fout << st << ' ' << dr << ' ' << rez;
return 0;
}