Pagini recente » Istoria paginii runda/oji20171112 | Cod sursa (job #442192) | Cod sursa (job #2888971) | Cod sursa (job #1690972) | Cod sursa (job #2956475)
#include <fstream>
using namespace std;
const int N = 100000;
const int INF = 100000000;
int main()
{
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, v[N] = {0}, sc = -1, st, smax = -INF, sk = 0, stmax, drmax;
fin >> n >> k;
for(int i = 1; i <= n; i++)
{
fin >> v[i];
sk += v[i];
if(i > k)
sk -= v[i - k];
if(sk > sc + v[i])
{
sc = sk;
st = i - k + 1;
}
else
sc += v[i];
if(i >= k && sc > smax)
{
smax = sc;
stmax = st;
drmax = i;
}
}
fout << stmax << ' ' << drmax << ' ' << smax;
fin.close();
fout.close();
return 0;
}