05 2020 档案
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2066 Problem Description 虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己
阅读全文
摘要：基本用法： 1 ///栈： 2 s.empty() ///判断栈是否为空 3 s.size() ///返回栈中元素个数 4 s.pop() ///删除栈顶元素 5 s.top()//返回栈顶元素 6 s.push(x) ///在栈顶压入新元素 7 8 ///队列： 9 q.empty() ///判断
阅读全文
摘要：1 #include <bits/stdc++.h> 2 3 using namespace std; 4 const int INF = 0x3f3f3f3f; 5 6 struct node 7 { 8 int v, w, next; 9 }edge[5000005]; 10 int n, to
阅读全文
摘要：A - Freight Train（二分+思维） https://www.cnblogs.com/0xiaoyu/p/12849760.html G - Physical Music（题意挺绕+简单思维） https://www.cnblogs.com/0xiaoyu/p/12846839.html
阅读全文
摘要：The chemical company NS (Nasty Substances) has three factories: one in the Netherlands, one in Belgium and one in Luxembourg. Chemicals are moved betw
阅读全文
摘要：Chess is a game in which two sides control pieces in an attempt to capture each other’s king. The pieces vary in mobility. At the beginning of a game
阅读全文
摘要：The music business is changing rapidly, and this is reflected by the single charts. Initially, the Dutch Single Top 100 was based purely on sale numbe
阅读全文
摘要：Consider $n$ segments on a two-dimensional plane, where the endpoints of the $i$-th segment are $(l_i, i)$ and $(r_i, i)$. One can put as many tokens
阅读全文
摘要：Warshall算法又叫floyd-Warshall算法，思想为i->j&&j->k，那么i->k 图上点的先后，这道题不能用拓扑排序做，但是拓扑排序只能得到一个整体“不错”的序列，并不能说明任意两点的先后。 1 #include <bits/stdc++.h> 2 3 using namespac
阅读全文
