#include <bits/stdc++.h>
const int inf = 0x3f3f3f3f;
//time complexity: O(n^3)
//Space complexity: O(n^2)
int main()
{
int n, m, x, y, z;
std::cin >> n >> m;
std::vector dp(n + 1, std::ve...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《[c++][图论][最短路] Floyd算法》 | 699字 | 3.2分钟 | 100% | 188 CPM | 42 次 | 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