- 博客(5)
- 收藏
- 关注
RSS订阅原创 动态规划部分题目小结
UVA10635 LCS转LIShttp://acm.bnu.edu.cn/bnuoj/problem_show.php?pid=19053两个长度为p+1和q+1的序列A，B，序列中元素互不相同，且都是1到n^2的整数，求AB的LCS，将A中元素变为1到p+1,B中不在A中的元素直接删掉，问题转换为在B中求LIS复杂度nlogn。#include using namespa
2015-11-28 22:39:48
738
2
原创 LA 3695 Distant Galaxy（扫描线）
Distant GalaxyTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVALive. Original ID: 369564-bit integer IO format: %lld Java class name: MainPrev Submit
2015-11-26 11:58:03
915
原创 LA 3029(悬线法)
City GameTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVALive. Original ID: 302964-bit integer IO format: %lld Java class name: MainPrev Submit Statu
2015-11-26 11:24:11
662
原创 LA 2678 Subsequence（尺取法）
SubsequenceTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVALive. Original ID: 267864-bit integer IO format: %lld Java class name: MainPrev Submit Sta
2015-11-26 00:49:42
691
原创 LA 3905（扫描线)
MeteorTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVALive. Original ID: 390564-bit integer IO format: %lld Java class name: MainPrev Submit Status S
2015-11-26 00:37:13
696
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人