Pagini recente » Cod sursa (job #1194912) | Cod sursa (job #2682319) | Cod sursa (job #1146631) | Cod sursa (job #1527708) | Cod sursa (job #1959718)
#include <fstream>
using namespace std;
int v[50001],s[50001],Min[50001];
int main()
{ int n,i,k,Max=0,ii,jj;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for (i=1;i<=n;++i) {
f>>v[i];
if (Min[i-1]+v[i]>v[i]) Min[i]=v[i];
s[i]=s[i-1]+v[i];
if (Max<s[i]-Min[i-k]) {
Max=s[i]-Min[i-k];
ii=i;
jj=i+k-1;
}
}
g<<Max<<" "<<ii<<" "<<jj;
return 0;
}