Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- #define int long long
- #define pb push_back
- #define endl "\n"
- #define mod 1000000007
- #define ld double
- #define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
- // for(int i = 0; i < n; i++)
- using namespace std;
- const int N =2e5 + 5;
- void solve() {
- int n, k;
- cin >> n >>k;
- int a[n];
- for(int i = 0; i < n; i++){
- cin >> a[i];
- }
- vector<pair<int,int>>v;
- int cnt = 0;
- for(int l = 0; l< n; l++){
- if(l > n - k){
- break;
- }
- int j = l;
- cnt = 0;
- while(j <= l + k -1){
- int cur = a[j];
- if(j - 1 >=0 and j + 1 <n){
- if(cur > a[j-1] && cur > a[j+1] && j+1<=l + k - 1 && j - 1 >= l - 1){
- cnt++;
- }
- }
- j++;
- }
- v.pb({cnt,l});
- }
- sort(v.rbegin(),v.rend());
- int mx = v[0].first,mn = LLONG_MAX;
- for(auto i:v){
- if(i.first == mx){
- mn = min(mn,i.second);
- }
- }
- cout<<mx+1<<' '<<mn+1<<endl;
- }
- int32_t main() {
- IOS
- int t;
- cin >> t;
- while(t--) {
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement