Super Mario
多组数据注意初始化
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll ;
int read()
{
int x = 0, f = 1; char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -f; c = getchar(); }
while(c >= '0' && c <= '9') {
x = x * 10 + c - '0'; c = getchar(); }
return x * f;
}
const int maxN = 100005;
int n, m, q;
int a[maxN], block[maxN];
vector<int>vt[maxN];
int query(int l, int r, int val) {
int ans = 0;
if(block[l] == block[r]) {
for(int i = l; i <= r; ++ i ) {
if(a[i] <= val) ++ ans;
}
} else {
for(int i = l; i <= block[l] * m; ++ i ) {
if(a[i] <= val) ++ ans;
}
for(int i = (block[r] - 1) * m + 1; i <= r; ++ i ) {
if(a[i] <= val) ++ ans;
}
for(int i = block[l] + 1; i <= block[r] - 1; ++ i ) {
ans += upper_bound(vt[i].begin(), vt[i].end(), val) - vt[i].begin();
}
}
return ans;
}
int main()
{
int T; cin >> T;
int cas = 0;
while(T -- ) {
n = read(); m = sqrt(n);
q = read();
for(int i = 1; i <= n; ++ i ) {
a[i] = read();
block[i] = (i - 1) / m + 1;
vt[block[i]].emplace_back(a[i]);
}
for(int i = 1; i <= block[n]; ++ i ) {
sort(vt[i].begin(), vt[i].end());
}
cout << "Case " << ++ cas << ":\n";
while(q -- ) {
int l, r, val;
l = read(), r = read(), val = read();
++ l, ++ r;
cout << query(l, r, val) << endl;
}
for(int i = 1; i <= block[n]; ++ i ) {
vt[i].clear();
}
}
return 0;
}