visited
[LeetCode] 1266. Minimum Time Visiting All Points
On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the ord ......
Codeforces Visit
Codeforces Visit 记录一下自己大概 vis 了那几场？？随机补题大法好！ CF632 Div.2 飞速模拟出 ABC。优势在我！ CF1333D 发现就是把字符串变成 LLRR 此类形状。所以开头必然是 L 啊，然后我们考虑先把 L 换到第一个。 发现必然是 LLLLLLLLLLLR ......
P5838 [USACO19DEC] Milk Visits G
P5838 [USACO19DEC] Milk Visits G Luogu P5838 Solution 提供一种奇特的 \(\mathcal O(\dfrac{n\sqrt n\log n}{\omega})\) 的做法。 树链剖分转化成序列问题。然后变成了询问一个区间 \(l,r\) 是否存在 ......
P5836 [USACO19DEC] Milk Visits S - 洛谷题解
题目链接 ：[P5836] USACO19DEC] Milk Visits S - 洛谷 | 计算机科学教育新生态 (luogu.com.cn) 这道题可以用并查集来解决。 题目中每个结点只有两个状态：H和G。那么我们可以推断出，只有当起点和终点间每个结点的状态相同但是起点（或者终点或起点到终点之间 ......
[LeetCode] 1560. Most Visited Sector in a Circular Track
Given an integer n and an integer array rounds. We have a circular track which consists of n sectors labeled from 1 to n. A marathon will be held on t ......
minio报错：Unable to use the drive /data: Drive /data: found backend type fs, expected xl or xl-single - to migrate to a supported backend visit https://min.io/docs/minio/linux***
docker安装minio，minio是最新的，使用命令：`docker pull minio/minio` 如下： . ......