Pagini recente » Cod sursa (job #1291720) | Arhiva de probleme | Cod sursa (job #1234443) | Istoria paginii runda/simulare_oji_2016/clasament | Cod sursa (job #1769892)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int v[50001];
int main()
{
int a,b,n,k,i,j,s=0,mx=-100000;
in>>n>>k;
for(i=1;i<=n;i++)
in>>v[i];
a=1;
b=k;
int outa,outb;
int copiek;
copiek=k;
while(copiek)
{
s=s+v[copiek];
copiek--;
}
if(s>=mx)
mx=s;
outa=a;
outb=b;
for(i=k+1;i<=n;i++)
{
s=s+v[i]-v[a];
a++;
b++;
if(s>mx)
{
mx=s;
outa=a;
outb=b;
}
}
while(v[outa-1]>=0&&outa>=2)
{
outa--;
mx+=v[outa];
}
while(v[outb+1]>=0&&outb<=n-1)
{
outb++;
mx+=v[outb];
}
out<<mx<<'\n'<<outa<<" "<<outb;
return 0;
}