相关阅读
相关 2019 Multi-University Training Contest 1 1002 线性基
题意:序列操作1.末尾加数 2.求区间异或最大值。 求区间异或的最大值很容易就想到用线性基去做 比赛的时候试了分块和线段树去维护线性基,结果都TLE了 之前也想到了
Bertha 。相关 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
àì夳堔傛蜴生んèń相关 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>
﹏ヽ暗。殇╰゛Y相关 2019 Multi-University Training Contest 2: 1010 Just Skip The Problem 自闭记
2019 Multi-University Training Contest 2: 1010 Just Skip The Problem 自闭记 题意 多测。每次给
相关 2019 Multi-University Training Contest 5
<table> <thead> <tr> <th>Solved</th> <th>Pro.ID</th> <th>Title</th>
相关 2019 Multi-University Training Contest 3
Find the answer 权值线段树 题意：给n个数字，m值，输出n个值，每次问对于前缀和1~i(1<=i<=n) 中，最少去掉(1,i-1)中多少个数字才能使前缀...
红太狼
还没有评论，来说两句吧...