Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int print_max_element(int a[], int start, int last){
- int i, max_item = start;
- for(i = start; i < last; i++){
- if(a[i] > a[max_item]) max_item = i;
- }
- return max_item;
- }
- int main(){
- int t; cin >> t;
- while(t--){
- int n, k; cin >> n >> k;
- int a[n], i;
- for(i = 0; i < n; i++) cin >> a[i];
- int key = -1, j = 0;
- key = print_max_element(a, 0, k);
- cout << a[key] << ' ';
- for(i = k; i < n; i++){
- if(j > key){
- if(j + k > n) key = print_max_element(a, j, n);
- else key = print_max_element(a, j, j+k);
- }
- else{
- if(a[i] > a[key]) key = i;
- }
- cout << a[key] << ' ';
- j++;
- }
- cout << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement