摘要：
详细题目见：http://7xjob4.com1.z0.glb.clouddn.com/0f10204481da21e62f8c145939e5828e思路：记dp[i][j]表示第i个木板尾部在j的方案数。那么对于i+1,可以分三种情况讨论，一种是i+1的头部在第i... 阅读全文
posted @ 2015-12-05 21:48
Herumw
阅读(210)
评论(0)
推荐(0)
摘要：
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2383 Accepted Submission(s)... 阅读全文
posted @ 2015-12-05 20:54
Herumw
阅读(115)
评论(0)
推荐(0)
摘要：
题目详见http://7xjob4.com1.z0.glb.clouddn.com/3f644de6844d64706eb36baa3a0c27b0这题是普通的拓扑排序，要把每一层的都保存下来。#include#include#include#include#incl... 阅读全文
posted @ 2015-12-05 17:57
Herumw
阅读(119)
评论(0)
推荐(0)
摘要：
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3354 Accepted Submission(s)... 阅读全文
posted @ 2015-12-05 10:55
Herumw
阅读(109)
评论(0)
推荐(0)
