Pagini recente » Cod sursa (job #2176749) | Cod sursa (job #354633) | Cod sursa (job #1909779) | Cod sursa (job #2251421) | Cod sursa (job #2511967)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int N=50003;
int v[N],n,k,s,smax,st=1,dr,a[N],x=1;
int main()
{
fin>>n>>k;
for(int i=1;i<=k;i++)
{
fin>>v[i];
a[i]=v[i]+a[i-1];
}
s=smax=a[k];
dr=k;
for(int i=k+1;i<=n;i++)
{
fin>>v[i];
a[i]=a[i-1]+v[i];
if(a[i]-a[i-k]>s+v[i])
{
s=a[i]-a[i-k];
x=i-k+1;
}
else
{
s+=v[i];
}
if(s>smax)
{
smax=s;
st=x;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<smax;
return 0;
}