Pagini recente » Cod sursa (job #3362916) | Cod sursa (job #3362680) | Cod sursa (job #3362949) | Cod sursa (job #3362959) | Cod sursa (job #3362843)
#include <iostream>
#include <fstream>
using namespace std;
long long v,sp[50001],mins[50001], pozmins[50001];
int main()
{
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int s=0, rst=1, rdr=1, raspmax=-2000000000, i, n, minsp=0, k;
fin >> n >> k;
for(i = 1; i <= n; i++)
{
fin >> v;
sp[i] = v + sp[i - 1];
mins[i] = sp[i];
pozmins[i] = i;
if(mins[i] > mins[i - 1])
{
mins[i] = mins[i - 1];
pozmins[i] = pozmins[i - 1];
}
}
for(i = 1; i <= n; i++)
{
if(i >= k)
{
s = sp[i] - mins[i - k];
if(s > raspmax)
{
raspmax = s;
rst = pozmins[i - k] + 1;
rdr = i;
}
}
}
fout << rst << " " << rdr << " " << raspmax;
return 0;
}