#include<bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 7;
typedef long long ll;
ll a[N];
ll n, p;
struct node
{
ll l;
ll r;
ll v;
ll lazyadd;
ll lazymul;
}tree[N * 4];
void pushup...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《线段树模板》 | 2123字 | 1.0分钟 | 100% | 14 CPM | 16 次 | 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