Pagini recente » Cod sursa (job #2266894) | Cod sursa (job #2619296) | Cod sursa (job #1823402) | Cod sursa (job #886184) | Cod sursa (job #2856894)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,v[50002],Smax=-99999999,S,lmax,l,pmax;
int main()
{
int i;
f >> n >> k;
for (i=1;i<=n;i++)
f >> v[i];
for (i=1;i<=n;i++)
{
S+=v[i];
l++;
if (S>=0)
{
if (S>Smax and l>=k)
{
Smax=S;
pmax=i;
lmax=l;
}
}
else
{
S=0;
l=0;
}
}
S=0;
if (Smax==-1)
{
for (i=1;i<=k-1;i++)
S+=v[i];
Smax=S+v[i+1];
for (i=k;i<=n;i++)
{
S+=v[i];
S-=v[i-k];
if (S>Smax)
{
Smax=S;
pmax=i;
}
}
lmax=k;
}
g << pmax-lmax+1 << " " << pmax << " " << Smax;
return 0;
}