Pagini recente » Cod sursa (job #2737391) | Cod sursa (job #1732423) | Clasament preoni52b | Cod sursa (job #419494) | Cod sursa (job #148457)
Cod sursa(job #148457)
#include <fstream.h>
long smax,ps,pi,s,a[50002],b[50002],n,i,j,k;
int main()
{
ifstream f("secv2.in");
f>>n>>k;
for(i=1;i<=k;i++)
{
f>>a[i];
b[i]=b[i-1]+a[i];
}
for(i=k+1;i<=n;i++)
{
f>>a[i];
b[i]=b[i-1]+a[i]-a[i-k];
if (a[i]+b[i-1]>b[i])b[i]=b[i]+a[i-k];
if (b[i]>smax)
{
smax=b[i];
ps=i;
}
}
f.close();
s=smax;
for (i=ps;i>0;i--)
{
s-=a[i];
if (s==0)
{
pi=i;
i=0;
}
}
ofstream g("secv2.out");
g<<pi<<" "<<ps<<" "<<smax<<"\n";
g.close();
return 0;
}