摘要:
```cpp n = read(); for (int i = 1; i <= n; ++ i) { a[i] = read(); b[i] = a[i]; } stable_sort(b + 1, b + 1 + n); len = unique(b + 1, b + 1 + n) - (b + 阅读全文
posted @ 2023-06-07 16:01
觉清风
阅读(21)
评论(0)
推荐(0)
摘要:
判断连通性 阅读全文
posted @ 2023-06-07 15:59
觉清风
阅读(25)
评论(0)
推荐(0)
摘要:
P3605 [USACO17JAN]Promotion Counting P 阅读全文
posted @ 2023-06-07 15:40
觉清风
阅读(23)
评论(0)
推荐(0)
摘要:
Luogu P4556 [Vani有约会]雨天的尾巴 /【模板】线段树合并 阅读全文
posted @ 2023-06-07 11:49
觉清风
阅读(31)
评论(0)
推荐(0)

浙公网安备 33010602011771号