Pagini recente » Cod sursa (job #2035029) | Cod sursa (job #2679656) | Cod sursa (job #131770) | Cod sursa (job #2287060) | Cod sursa (job #2538525)
#include <fstream>
#include <climits>
using namespace std;
std::ifstream f("secv2.in");
std::ofstream g("secv2.out");
int v[100001], sp[100001];
int n, k, suma, smax = INT_MIN;
int i, imax, imin, j;
int main()
{
f >> n >> k;
f >> v[1];
sp[1] = v[1];
v[0] = 0;
for (i = 2; i <= n; i++)
{
f >> v[i];
sp[i] = v[i] + sp[i - 1];
}
for (i = 1; i <= n; i++)
{
for (j = i; j <= n; j++)
{
if (sp[j] - sp[i - 1] > smax&& j - i + 1 >= k)
{
smax = sp[j] - sp[i - 1];
imax = j;
imin = i;
}
}
}
g << imin << " " << smax << " " << imax;
}