Pagini recente » Borderou de evaluare (job #2242805) | Istoria paginii utilizator/serbanule | Diferente pentru problema/nambartiori intre reviziile 102 si 42 | Profil tribanp | Cod sursa (job #1769884)
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[5001];
int main()
{
int n,k,i,j,w,a=1,b;
long long maxs=0,s=0,cs=0;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
if(i<=k)
s=s+v[i];
}
maxs=s;
cs=s;
b=k;
for(i=k+1;i<=n;i++)
{
cs=cs+v[i];
if(cs>maxs)
{
maxs=cs;
a=1;
b=i;
}
}
for(i=1,j=k+1;j<=n;i++,j++)
{
s=s-v[i]+v[j];
cs=s;
if(cs>maxs)
{
maxs=cs;
a=i+1;
b=j;
}
for(w=j+1;w<=n;w++)
{
cs=cs+v[w];
if(cs>maxs)
{
maxs=cs;
a=i+1;
b=w;
}
}
}
out<<maxs<<"\n"<<a<<" "<<b;
return 0;
}