Pagini recente » Cod sursa (job #2580862) | Cod sursa (job #1174052) | Cod sursa (job #2107268) | Cod sursa (job #938449) | Cod sursa (job #1147347)
#include <fstream>
#include <iostream>
using namespace std;
int n, k, x, s[50001], min1 = 25001, max1 = -25001, lf, rg;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
void Read();
void Write();
void Read()
{
int i;
f >> n >> k;
for (i = 1; i <= n; ++i)
{
f >> x;
s[i] = s[i-1]+x;
}
f.close();
}
void Write()
{
int i;
for (i = k; i <= n; i++)
{
if (min1> s[i-k]) {
min1 = s[i-k];
x = i-k;
}
if (s[i]- min1 > max1) {
max1 = s[i] - min1;
lf = x+1;
rg = i;
}
}
g << lf <<"\t" << rg << "\t" << max1;
g.close();
}
int main()
{
Read();
Write();
return 0;
}