Pagini recente » Cod sursa (job #1622403) | Cod sursa (job #1044194) | Cod sursa (job #2463613) | Cod sursa (job #2463519) | Cod sursa (job #1980902)
#include <fstream>
using namespace std;
int v[50001];
int main()
{ int sum=0,st,dr,Min,x,k,n,i,p;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for (i=1;i<=n;++i) {
f>>x;
v[i]=v[i-1]+x;
if (i>=k) {
if (i==k) {
Min=v[i-k];
p=0;
}
else if (Min>v[i-k]) {
Min=v[i-k];
p=i-k;
}
if (v[i]-Min>sum) {
sum=v[i]-Min;
st=p+1;
dr=i;
}
}
}
g<<st<<" "<<dr<<" "<<sum<<'\n';
return 0;
}