fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6. inline int power(int a, int b) {
  7. int x = 1;
  8. while (b) {
  9. if (b & 1) x *= a;
  10. a *= a;
  11. b >>= 1;
  12. }
  13. return x;
  14. }
  15.  
  16.  
  17. const int M = 1000000007;
  18. const int N = 3e5+9;
  19. const int INF = 2e9+1;
  20. const int LINF = 2000000000000000001;
  21.  
  22. //_ ***************************** START Below *******************************
  23.  
  24. vector<int> a;
  25.  
  26. pair<int,int> consistency(int n, int k){
  27.  
  28. int s = 0, e = 0;
  29. int maxPeaks = INT32_MIN;
  30. int left = -1;
  31.  
  32. set<int> peaks;
  33.  
  34. while(e<n){
  35. if(e-2>=0 && a[e-1] > a[e-2] && a[e-1] > a[e]){
  36. peaks.insert(e-1);
  37. }
  38.  
  39. if(e-s+1<k){
  40. e++;
  41. }
  42. else{
  43. int p = peaks.size();
  44. if(p > maxPeaks){
  45. maxPeaks = p;
  46. left = s;
  47. }
  48.  
  49. if(peaks.count(s+1)) peaks.erase(s+1);
  50. s++;
  51. e++;
  52. }
  53. }
  54.  
  55.  
  56. return {maxPeaks+1, left+1};
  57.  
  58. }
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. void solve() {
  71.  
  72. int n, k;
  73. cin>>n >> k;
  74.  
  75. a.resize(n);
  76. for(int i=0; i<n; i++) cin >> a[i];
  77.  
  78. auto ans = consistency(n, k);
  79. cout << ans.first << " " << ans.second << endl;
  80.  
  81.  
  82. }
  83.  
  84.  
  85.  
  86.  
  87.  
  88. int32_t main() {
  89. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  90.  
  91. int t = 1;
  92. cin >> t;
  93. while (t--) {
  94. solve();
  95. }
  96.  
  97. return 0;
  98. }
Success #stdin #stdout 0s 5320KB
stdin
6
8 6
1 2 4 1 2 4 1 2
5 3
3 2 3 2 1
10 4
4 3 4 3 2 3 2 1 0 1
15 7
3 7 4 8 2 3 4 5 21 2 3 4 2 1 3
7 5
1 2 3 4 5 6 1
13 3
2760 2762 2772 2777 2787 2794 2798 2804 2806 2813 2822 2832 2837
stdout
3 2
2 2
2 1
3 1
2 3
1 1