Pagini recente » Cod sursa (job #1784882) | Cod sursa (job #2814588) | Cod sursa (job #519642) | Cod sursa (job #1400307) | Cod sursa (job #2566660)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, v[50005], smax, imax, jmax;
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; i++)
fin >> v[i];
for(int i = 1; i <= n; i++){
if(v[i] <= 0)
continue;
else{
int s = 0;
for(int j = i; j <= i+k; j++)
s += v[j];
if(s > smax){
smax = s;
imax = i;
jmax = i+k;
}
for(int j = i+k+1; j <= n; j++){
s += v[j];
if(s > smax){
smax = s;
imax = i;
jmax = j;
}
}
}
}
fout << imax << " " << jmax << " " << smax;
return 0;
}