nastyaAndDoor.cpp

//codeforces.com/contest/1341/problem/B

#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define fr(i, n) for(int i = 0; i < n; i++)
#define frr(i, n) for(int i = 1; i <= n; i++)

#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
#define ms(x, i) memset(x, i, sizeof(x))

#define p(x) cout << x << "\n"
#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]

#define f first
#define s second

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f;

int main() {
    fastio;

    int t;
    cin >> t;
    while (t--) {

        int k, n;
        cin >> n >> k;

        int v[n];
        fr(i, n) cin >> v[i];

        int l = 1, r = k-1, cnt = 0;
        frr(i, k-2) if (v[i] > v[i-1] && v[i] > v[i+1]) cnt++;
        pii ans = {cnt, 0};
        for (; l <= n-k; l++, r++) {
            if (v[l] > v[l-1] && v[l] > v[l+1]) cnt--;
            if (v[r] > v[r-1] && v[r] > v[r+1]) cnt++;
            if (cnt > ans.f) ans = {cnt, l};
        }

        cout << ans.f+1 << " " << ans.s+1 << endl;
    }
}