Pagini recente » Cod sursa (job #3322315) | Cod sursa (job #3317227) | Cod sursa (job #46721) | Cod sursa (job #347868) | Cod sursa (job #3316453)
#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
deque<int> dq;
int n, k;
cin >> n >> k;
int v[n + 1];
for(int i = 1; i <= n; i ++){
cin >> v[i];
}
int maxi = -30001, mini = 30001, cnt = k + 1, fst, sec;
for(int i = 1; i <= k; i ++)
dq.push_back(i);
while(dq.front() != n - k){
mini = 30001;
for(int i = dq.front(); i <= dq.back(); i ++){
mini = min(mini, v[i]);
}
if(mini > maxi)
maxi = mini, fst = dq.front(), sec = dq.back();
dq.pop_front();
dq.push_back(cnt);
cnt ++;
}
mini = 30001;
dq.pop_front();
dq.push_back(cnt);
for(int i = dq.front(); i <= dq.back(); i ++){
mini = min(mini, v[i]);
}
if(mini > maxi)
maxi = mini, fst = dq.front(), sec = dq.back();
cout << fst << ' ' << sec << ' ' << maxi;
}