HDU 6058 Kanade's sum

#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <iomanip>
#define N 1000010
#define LL __int64
#define inf 0x3f3f3f3f
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
using namespace std;
const LL mod = 1e9 + 7;
const double eps = 1e-9;
int num
;
int pre
;
int main() {
cin.sync_with_stdio(false);
int n, T, k;
cin >> T;
while (T--) {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> num[i];
}
LL ans = 0;
for (int i = 1; i <= n; i++) {
int x = num[i];
int cnt = 0, j, sum = 0;
pre[++cnt] = i;
for (j = i + 1; j <= n&&cnt < k; j++) {//向右找到k-1个比x大的数
if (num[j] > x) {
pre[++cnt] = j;
}
}

cb64
if (cnt == k) {//如果右边有k-1个比x大的数
int nums = 1;
for (; j <= n; j++) {//向右扩张区间
if (num[j] < x) {
nums++;
}
else {
break;
}
}
sum += nums;
for (j = i - 1; j >= 1 && cnt >= 1; j--) {//向左扩张区间
if (num[j] > x) {
if (cnt == 1) {
break;
}
else {
nums = pre[cnt] - pre[cnt - 1];//遗弃最右边的值，更新剩余区间长度
cnt--;
}
}
sum += nums;
}
}
else {
for (j = i - 1; j >= 1 && cnt < k; j--) {
if (num[j] > x) {
pre[++cnt] = j;
}
}
if (cnt == k) {
sort(pre + 1, pre + cnt + 1);
int nums = n - pre[cnt] + 1;//因为右边都没有满，所以剩余的区间长度就是最左边的比x大的数到末尾的长度
sum += nums;
for (; j >= 1 && pre[cnt] >= i; j--) {
if (num[j] > x) {
if (pre[cnt] == i) {
break;
}
else {
nums = abs(pre[cnt] - pre[cnt - 1]);//遗弃最右边的值，更新剩余区间长度
cnt--;
}
}
sum += nums;
}
}
}
ans += (LL)x*sum;
}
cout << ans << endl;
}
return 0;
}