Pagini recente » Cod sursa (job #3169933) | Cod sursa (job #1614776) | Cod sursa (job #2888779) | Cod sursa (job #2999967) | Cod sursa (job #2035236)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,i,j,k,I,J,Max;
int S[50001],x[50001];
int main()
{
f>>n>>k;
for(i=1;i<=n;++i ){
f>>x[i];
}
for(i=1;i<=n;i++){
S[i]=S[i-1]+x[i];
}
Max=0;
for(i=k;i<=n;i++){
for(j=0;j<=n-k;j++)
if(S[i]-S[j]>Max){
Max=S[i]-S[j];
I=j+1;
J=i;
}
}
g<<I<<" "<<J<<" "<<Max;
return 0;
}