Pagini recente » Cod sursa (job #685403) | Cod sursa (job #2732134) | Cod sursa (job #3151914) | Cod sursa (job #1793360) | Cod sursa (job #2938209)
#include <iostream>
#include <fstream>
#include <deque>
#include <vector>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k;
vector <int> a;
deque <int> d;
void citire()
{
fin >> n >> k;
a.push_back(-1);
for(int i = 1; i <= n; i++)
{
int x;
fin >> x;
a.push_back(x);
}
}
void minim()
{
int vmax = -1, pmax = -1;
for(int i = 1; i <= n - k + 1; i++)
if(a[i] > vmax)
{
vmax = a[i];
pmax = i;
}
if(pmax == n - k + 1)
{
fout << pmax << ' ' << n << ' ' << vmax;
}
else
fout << pmax << ' ' << pmax + k - 1 << ' ' << vmax;
}
int main()
{
citire();
minim();
return 0;
}