Pagini recente » Istoria paginii utilizator/duduuuus | Istoria paginii utilizator/alexcoman777 | Minesweeper | Istoria paginii utilizator/sebmih | Cod sursa (job #3317369)
#include <fstream>
using namespace std;
const int maxn=50005;
int s[maxn];
int n,k;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++){
int x;
cin>>x;
s[i]=s[i-1]+x;
}
int mn=0,poz=0;
int ans=-1e9;
int st,dr;
for(int i=k;i<=n;i++){
if(s[i]-mn>ans){
ans=s[i]-mn;
st=poz+1,dr=i;
}
if(s[i-k]<mn){
mn=s[i-k];
poz=i-k;
}
}
cout<<st<<" "<<dr<<" "<<ans;
return 0;
}