Pagini recente » Cod sursa (job #1885043) | Cod sursa (job #147403) | Cod sursa (job #2885439) | Cod sursa (job #1305132) | Cod sursa (job #2921317)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("in.txt");
ofstream g("out.txt");
struct l
{
int x, y, b;
}c[10000];
int v[1000], n, k,Min,m,OK;
int main()
{
f >> n >> k;
for (int i = 1; i <= n; i++)
{
f >> v[i];
}
for (int i = 1; i <= n - k + 1; i++)
{
int j = i; Min = v[j];
while (j <= i + k - 1)
{
if (v[j] < Min)
Min = v[j];
j++;
}
c[++m].b = Min;
c[m].x = i;
c[m].y = j - 1;
}
do
{
OK = 1;
for (int i = 1; i < m; i++)
{
if (c[i].b < c[i + 1].b)
{
OK = 0;
c[i].b = c[i].b + c[i + 1].b;
c[i + 1].b = c[i].b - c[i + 1].b;
c[i].b = c[i].b - c[i + 1].b;
c[i].x = c[i].x + c[i + 1].x;
c[i + 1].x = c[i].x - c[i + 1].x;
c[i].x = c[i].x - c[i + 1].x;
c[i].y = c[i].y + c[i + 1].y;
c[i + 1].y = c[i].y - c[i + 1].y;
c[i].y = c[i].y - c[i + 1].y;
}
}
} while (OK == 0);
g << c[1].x << " " << c[1].y << " " << c[1].b;
return 0;
}