摘要:
ccf 货物调度 c++ include include include include include include include include include include include include include include include include include i 阅读全文
摘要:
无向图的欧拉路经,并且输出字典序最小的方案。 c++ include using namespace std; const int maxn = 1e4+10; bool vis[maxn][maxn]; vectorG[maxn]; int n, m; int d[maxn]; int main( 阅读全文
摘要:
二分+并查集 发现了一个很奇怪的问题,二分的上界设置错了,结果是运行错误。。。只有95分。后来改了上界就100了,百思不得其解 c++ include include include include include include include include include include us 阅读全文
摘要:
A B C 等比数列的性质,前面的 项的和,不会超过第 项 D 有若干个区间,要求每一个点被区间覆盖的次数不能超过k个。问移除的最少的区间的数目。 贪心: 若某个点被覆盖了k次以上,那么肯定是移除这些区间里面右端点最右的点的区间。 时间复杂度要求是$O(nlog(n))$ 模拟就好了 c++ inc 阅读全文