Pagini recente » Cod sursa (job #1829236) | Cod sursa (job #2509346) | Cod sursa (job #1034439) | Cod sursa (job #372534) | Cod sursa (job #1325774)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f_in("secventa.in");
ofstream f_out("secventa.out");
int n, k, sum = 0, max = -99999, spos, min = 99999;
f_in >> n;
f_in >> k;
int a[n], b[k];
for (int i = 0; i < n; i++)
{
f_in >> a[i];
}
for (int i = 0; i <= n - k; i++)
{
for (int j = i; j <= i + k; j++)
{
sum += a[j];
}
if (sum > max)
{
max = sum;
spos = i;
}
}
for (int i = spos; i < spos + k; i++)
{
if (a[i] < min)
min = a[i];
}
f_out << spos + 1 << " " << spos + k << " " << min;
cin.get();
return 0;
}