Pagini recente » Cod sursa (job #1236846) | Istoria paginii utilizator/liviudan | Cod sursa (job #1001240) | Cod sursa (job #2149853) | Cod sursa (job #1635175)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int main(){
int sum=0,bestSum=-10000000,x,n,dr,st,bdr,bst,k;
in>>n>>k;
for(int i=1;i<=n;i++){
in>>x;
if(sum>=0){
sum+=x;
dr++;
}
else{
sum=x;
st=i;
dr=i;
}
if(sum>bestSum&&dr-st>=k-1){
bestSum=sum;
bst=st;
bdr=dr;
}
}
out<<bst<<" "<<bdr<<" "<<bestSum;
return 0;
}