0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 03:31:59 +00:00

B - Rising Sand

https://codeforces.com/contest/1698/submission/162069282
This commit is contained in:
Baoshuo Ren 2022-06-28 22:48:32 +08:00
parent a2de5b7967
commit 335144fdfc
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A

38
Codeforces/1698/B/B.cpp Normal file
View File

@ -0,0 +1,38 @@
#include <iostream>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 2e5 + 5;
int t, n, k, a[N];
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> t;
while (t--) {
int cnt = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i < n; i++) {
if (a[i - 1] + a[i + 1] < a[i]) cnt++;
}
if (k == 1) {
cout << (n - 1) / 2 << endl;
} else {
cout << cnt << endl;
}
}
return 0;
}