ACcoders

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66989#overview J - Assign the task Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Practice HD

http://acm.hdu.edu.cn/showproblem.php?pid=1394 Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16259    Accepte

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66989#problem/I I - Tunnel Warfare Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Pract

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66989#problem/H 这一题要注意剪枝，所有不必访问的点都不需要再访问了，注意最小的值不是0而是1； H - Can you answer these queries? Time Limit:2000MS     Memory Limit:65768KB 

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66989#problem/F 线段树入门，起初，设置数组sum=-1表示无颜色,sum=-2表示下方无统一颜色；sum>=0表示颜色为sum的占据了整个子树 li ri数组==-1，-1表示左右无统一颜色其他表示区间rt左边颜色为li右边为ri，这样既可实现本题 看代码 #incl

http://acm.hdu.edu.cn/showproblem.php?pid=1698 Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 25362    Accepted Submission(

贴海报呀贴海报 http://acm.hdu.edu.cn/showproblem.php?pid=2795 Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17388    Accepted S

http://acm.hdu.edu.cn/showproblem.php?pid=1542 参考了某某大牛的代码。确实代码飘逸，给上注释，怕自己忘了； Atlantis Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10210

http://acm.hdu.edu.cn/showproblem.php?pid=3265 Posters Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5762    Accepted Submission(s): 1