Pagini recente » Cod sursa (job #351863) | Cod sursa (job #976802) | Cod sursa (job #2615199) | Cod sursa (job #2026811) | Cod sursa (job #362859)
Cod sursa(job #362859)
#include<iostream>
#include<fstream>
using namespace std;
int s[50001],a[50001];
int main ()
{
int p,i2,k,i,sc=0,smax=-100,n,j;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n;
f>>k;
for(i=1; i<=n; i++)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
smax=sc=s[k];
i2=1;
p=1;
j=k;
for(i=k+1; i<=n; i++)
{
if (sc+a[i]>s[i]-s[i-k])
{
sc=sc+a[i];
}
else
{
sc=s[i]-s[i-k];
i2=i-k+1;
}
if (smax<sc)
{
smax=sc;
j=i;
p=i2;
}
}
g<<p<<" "<<j<<" "<<smax;
f.close(); g.close();
return 0;
}