当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5125:magic balls

题目描述
The town of W has N people. Each person takes two magic balls A and B every day. Each ball has the volume $a_i$ and $b_i$. People often stand together. The wizard will find the longest increasing subsequence in the ball A. The wizard has M energy. Each point of energy can change the two balls’ volume.($\text{swap}(a_i, b_i)$).The wizard wants to know how to make the longest increasing subsequence and the energy is not negative in last. In order to simplify the problem, you only need to output how long the longest increasing subsequence is.
输入解释
The first line contains a single integer $T(1 \leq T \leq 20)$(the data for $N > 100$ less than 6 cases), indicating the number of test cases.
Each test case begins with two integer $N(1 \leq N \leq 1000)$ and $M(0 \leq M \leq 1000)$,indicating the number of people and the number of the wizard’s energy. Next N lines contains two integer $a_i$ and $b_i(1 \leq a_i, b_i \leq 10^9)$,indicating the balls’ volume.
输出解释
For each case, output an integer means how long the longest increasing subsequence is.
输入样例
2
5 3
5 1
4 2
3 1
2 4
3 1
5 4
5 1
4 2
3 1
2 4
3 1
输出样例
4
4
来自杭电HDUOJ的附加信息
Recommend heyang

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #20

源链接: HDU-5125

最后修改于 2020-10-25T23:20:01+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 32768/32768K(Java/Others)