Pagini recente » Cod sursa (job #2884137) | Cod sursa (job #1533224) | Cod sursa (job #895446) | Cod sursa (job #1619971) | Cod sursa (job #957289)
Cod sursa(job #957289)
#include<fstream>
using namespace std;
int v[5000],s[5000],n,k,in,sf,st,sum,max1;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>v[i];
s[i]=v[i]+s[i-1];
}
max1=v[1];
max1=sum=s[k];
st=in=1;
sf=k;
for(int i=k+1;i<=n;i++)
{
if(s[i]-s[i-k]>=v[i]+sum)
{
sum=s[i]-s[i-k];
st=i-k+1;
}
else
sum+=v[i];
if(sum>max1)
{
max1=sum;
sf = i;
in = st;
}
}
g<<in<<" "<<sf<<" "<<max1;
}