Pagini recente » Cod sursa (job #1144297) | Cod sursa (job #2038388) | Cod sursa (job #913865) | Cod sursa (job #1535499) | Cod sursa (job #2446301)
#include <iostream>
#include <fstream>
std::ifstream f("secv2.in");
std::ofstream g("secv2.out");
const int NMAX = 50'000;
int n,k,v[NMAX + 5],dp[NMAX + 5],maxx,start,end;
int main(){
f >> n >> k;
for(int i = 1;i <= n;i++){
f >> v[i];
dp[i] = dp[i - 1] + v[i];
}
for(int i = 1;i <= n - k;i++)
for(int j = k + i;j <= n;j++){
if(dp[j] - dp[i - 1] > maxx){
maxx = dp[j] - dp[i - 1];
start = i;
end = j;
}
}
g << start << ' ' << end << ' ' << maxx;
f.close();
g.close();
return 0;
}