Pagini recente » Cod sursa (job #561354) | Cod sursa (job #2494632) | Cod sursa (job #2904877) | Cod sursa (job #2422861) | Cod sursa (job #2295351)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
const int N = 50001;
int sp[N];
int main()
{
int n, k, st=1, dr, sc=0, smx, stmx, drmx;
in >> n >> k;
dr=k;
for(int i=1; i<=k; i++)
{
int x;
in >> x;
sc+=x;
sp[i]=sp[i-1]+x;
}
stmx=st;
drmx=dr;
smx=sc;
for(int i=k+1; i<=n; i++)
{
int x;
in >> x;
sp[i]=sp[i-1]+x;
if(sc+x>sp[i-1]-sp[i-k]+x)
{
dr++;
sc+=x;
}
else
{
st=i-k+1;
dr++;
sc=sp[i-1]-sp[i-k]+x;
}
if(sc>smx)
{
stmx=st;
drmx=dr;
smx=sc;
}
}
out << stmx << ' ' << drmx << ' ' << smx;
return 0;
}