#include <bits/stdc++.h>
using ll = long long;
struct node{
node* ch[2];
int val, rank;
int rep_cnt;
int siz;
node(int val) : val(val), rep_cnt(1), siz(1) {
ch[0] = ch[1] = nullptr;
rank = ra...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《[c++] Treap》 | 1288字 | 7.0分钟 | 100% | 168 CPM | 182 次 | 0 | 良好，向更快挑战！ |
|
Suggestion:
可能对按键不够熟悉，或者对输入法不够熟练所导致，不要急慢慢来，先打对把准确率提高，然后逐渐的加快速度，最后才能打准打快。
|
|||||||
| Inspirational quotes: 人生布满了荆棘，我们想的惟一办法是从那些荆棘上迅速跨过。 ——伏尔泰 | |||||||
| What do you think of this article? Give it a rating and let it serve as a guiding light for others | |||||||
Registration with the Ministry of Industry and Information Technology: Min ICP No. 19000005