2012 ACM/ICPC 成都赛区网络赛解题报告汇总

九月 16th, 2012 | Posted by huangkun in ICPC 2012 亚洲区 | 信息聚合 | 解题报告
欢迎转载,转载请注明出处。




本日志汇总了2012年9月16日ACM/ICPC亚洲区域赛成都赛区网络赛的解题报告。解题报告来源于ACMer们发布的解题报告,方便大家互相学习。欢迎补充和完善本日志。

感谢所有及时发布解题报告,和大家分享知识的各位神牛。

感谢北京师范大学某队提供的除C题以外的代码,打包下载 chengdu_online_20120916_bnu.zip

题目链接

A Coder (HDU 4288,与Codeforces 85D相同)
http://hi.baidu.com/edward_mj/item/6172f0c08f01c541a9ba94f8
http://blog.csdn.net/haha593572013/article/details/7985238
http://blog.csdn.net/acm_cxlove/article/details/7985317
http://www.cnblogs.com/kuangbin/archive/2012/09/16/2687754.html

B Control (HDU 4289)
http://www.cnblogs.com/yejinru/archive/2012/09/16/2687642.html
http://blog.sina.com.cn/s/blog_691ce2b70101a7tn.html
http://blog.csdn.net/haha593572013/article/details/7985238
http://blog.csdn.net/michaleleo/article/details/7985332
http://bbezxcy.iteye.com/blog/1679422

C Counting Formations (HDU 4290)
http://www.cnblogs.com/CSGrandeur/archive/2012/09/17/2688142.html

D A Short problem (HDU 4291)
http://www.cnblogs.com/CSGrandeur/archive/2012/09/16/2687739.html
http://www.cnblogs.com/vongang/archive/2012/09/16/2687781.html
http://user.qzone.qq.com/909938252/blog/1347799230
http://www.cnblogs.com/xiaoxian1369/archive/2012/09/16/2687881.html

E Food (HDU 4292)
http://www.cnblogs.com/yejinru/archive/2012/09/16/2687642.html
http://blog.sina.com.cn/s/blog_691ce2b70101a7uh.html
http://www.cnblogs.com/kuangbin/archive/2012/09/16/2687759.html
http://www.cgangee.com/?aid=68
http://bbezxcy.iteye.com/blog/1679431

F Groups (HDU 4293)
http://blog.csdn.net/taozifish/article/details/7985044
http://blog.csdn.net/aroslhy/article/details/7985200
http://blog.csdn.net/kk303/article/details/7989301

G Multiple (HDU 4294)
http://www.cnblogs.com/CSGrandeur/archive/2012/09/16/2687746.html
http://hi.baidu.com/isaacpei/item/509992045b773b103a53eee4

H 4 substrings problem (HDU 4295)
Rank1的旅游队的WJMZBMR提供的思路:

  • 首先预处理出can[i][j]表示第i位开始能不能放第j个子串,随便用个什么KMP就行了,然后我们从原串的第一位开始考虑,不妨说当前到了原串的第i位,还剩下rem这个集合的子串可以放,只要再记录之前的子串从i往后覆盖了几个就可以dp了.
  • 状态就是dp[i][rem][k],然后只要枚举在第i位放不放和放哪一个串,更新一下k就行了,只是要注意可能在第i位同时放几个串…

http://fayaa.com/code/view/27243/

I Buildings (HDU 4296)
http://www.cnblogs.com/Yu2012/archive/2012/09/16/2687673.html
http://blog.csdn.net/acm_ted/article/details/7984935
http://blog.csdn.net/boyzhirui/article/details/7985167
http://blog.csdn.net/yinyuanlin123/article/details/7985111

J One and One Story (HDU 4297)
http://blog.csdn.net/kksleric/article/details/7985191
http://hi.baidu.com/dut200901102/item/ee6a94037d2608d0dce5b0f7

You can follow any responses to this entry through the RSS 2.0 You can skip to the end and leave a response. Pinging is currently not allowed.

21 Responses



留言给 noname 取消留言

电子邮件地址不会被公开。 必填项已用*标注