Pagini recente » Cod sursa (job #2048830) | Cod sursa (job #1719869) | Cod sursa (job #1199063) | Cod sursa (job #2964481) | Cod sursa (job #1436175)
#include <fstream>
using namespace std;
int n, k, i, v[50001], p, pm, um, s[50001], Max;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
}
p=1, pm=1, um=1;
s[1]=v[1], Max=v[1];
for(i=2;i<=n;i++){
if(v[i] > s[i-1]+v[i]){
s[i] = v[i];
p = i;
}else{
s[i] = s[i-1]+v[i];
}
if(s[i] > Max && i-p >= k){
Max = s[i];
pm = p;
um = i;
}
}
fout<<pm<<" "<<um<<" "<<Max;
}