Pagini recente » Cod sursa (job #3127429) | Cod sursa (job #1744321) | Cod sursa (job #2348693) | Cod sursa (job #2180225) | Cod sursa (job #2511963)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int N=50001;
int v[N],n,k,s,smax=-25000*50000,st,dr,a[N],ans1,ans2;
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];
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];
if(s>smax)
{
smax=s;
st=i-k+1;
dr=i;
}
}
else
{
s+=v[i];
if(s>smax)
{
smax=s;
dr=i;
}
}
}
fout<<st<<" "<<dr<<" "<<smax;
return 0;
}