Pagini recente » Cod sursa (job #2360018) | Cod sursa (job #1617529) | Cod sursa (job #3308943) | Cod sursa (job #1017846) | Cod sursa (job #3304703)
#include <fstream>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
const int maxi=6e6;
int s[maxi+1];
int main(){
int n,x,k,mini=0;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>x;
s[i]=s[i-1]+x;
}
int smax=s[n];
int st=1,dr=n;
for(int i=k;i<=n;i++){
if(s[i-k]<s[mini]) mini=i-k;
if(s[i]-s[mini]>smax){
smax=s[i]-s[mini];
st=mini+1;
dr=i;
}
}
cout<<st<<" "<<dr<<" "<<smax;
}