摘要:
枚举,时间复杂度 O(L∗(m+n))#include#include#include#include#include#include#include#include#include#include#include#includeconst int MAXN = 305,MAXM =... 阅读全文
posted @ 2015-05-13 21:31
<Dash>
阅读(121)
评论(0)
推荐(0)
摘要:
DP,当然大家题解写得很详细我也没有什么好说的。#include#include#include#include#includeconst int LEN = 16, MAXK = LEN*LEN, Nya = -1, SIZE = (1 ret) ... 阅读全文
posted @ 2015-05-13 19:20
<Dash>
阅读(156)
评论(0)
推荐(0)

浙公网安备 33010602011771号