发表评论取消回复
相关阅读
相关 2019 Multi-University Training Contest 1 补题
贴一下队友博客链接 > [https://blog.csdn.net/qq\_38515845/article/details/97438369][https_blog.cs
相关 2019 Multi-University Training Contest 2 1011主席树
Problem Description N sticks are arranged in a row, and their lengths are a1,a2,...,aN.
相关 2019 Multi-University Training Contest 4
-------------------- A. AND Minimum Spanning Tree solved by rdc 21min -1 数组开小了,解体了一次
相关 2019 Multi-University Training Contest 2 - 1008 - Harmonious Army - 最大流
[http://acm.hdu.edu.cn/showproblem.php?pid=6598][http_acm.hdu.edu.cn_showproblem.php_pid
相关 2019HDU多校赛第二场 H HDU 6598 Harmonious Army(最小割模型)
参考博客https://blog.csdn.net/u013534123/article/details/97142191 include<bits/stdc++.h
相关 2019 Multi-University Training Contest 1 - Vacation
思维 可以想到,速度慢的车一定会堵住他后面速度比他快的车,所以在到达终点线的时候,0车也可能会被前面的车堵住。 假设在0车之前有一辆车x,他的速度比x+1车要慢,且比\
相关 2019 Multi-University Training Contest 7
<table> <thead> <tr> <th>Solved</th> <th>Pro.ID</th> <th>Title</th>
相关 2019 Multi-University Training Contest 5
<table> <thead> <tr> <th>Solved</th> <th>Pro.ID</th> <th>Title</th>
相关 HDU6598 Harmonious Army
经典网络流模型,可以看一下论文(浅析一类最小割问题(pty)) ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow
相关 2019 Multi-University Training Contest 3
Find the answer 权值线段树 题意:给n个数字,m值,输出n个值,每次问对于前缀和1~i(1<=i<=n) 中,最少去掉(1,i-1)中多少个数字才能使前缀...
还没有评论,来说两句吧...