#include <bits/stdc++.h>
using ll = long long;
#define MAX_N 1000006
int tr[MAX_N], a[MAX_N];
int n, q, op, l, r;
int lowbit(int x) {
return x & -x;
}
int init() {
for(int i = 1; i <= n; i++) {
tr...
English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
---|---|---|---|---|---|---|---|
《[c++] 树状数组》 | 779字 | 3.7分钟 | 100% | 190 CPM | 131 次 | 1 | 良好,向更快挑战! |
The wrong word this time: & | |||||||
Suggestion:
可能对按键不够熟悉,或者对输入法不够熟练所导致,不要急慢慢来,先打对把准确率提高,然后逐渐的加快速度,最后才能打准打快。
|
|||||||
Inspirational quotes: 失言就是一不小心说了实话。 ——于丹 | |||||||
What do you think of this article? Give it a rating and let it serve as a guiding light for others |