OJ
萧逸思
这个作者很懒,什么都没留下…
展开
-
UVa 455 Periodic Strings
Problem A character string is said to have period k if it can be formed by concatenating one or more repetitions of another string of length k. For example, the string "abcabcabcabc" has period 3,原创 2015-01-28 19:01:14 · 322 阅读 · 0 评论 -
zoj 1201 Inversion
Inversion Time Limit: 2 Seconds Memory Limit: 65536 KB Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i Aj then the pair (Ai,Aj) is called an "inversion" of the permut原创 2015-01-30 14:29:38 · 374 阅读 · 0 评论 -
UVa 202 Repeating Decimals
Repeating Decimals原创 2015-02-26 17:16:35 · 361 阅读 · 0 评论 -
UVa 1587 Box
Box原创 2015-02-27 19:24:28 · 362 阅读 · 0 评论 -
UVa 227 Puzzle
Puzzle原创 2015-02-27 13:02:53 · 439 阅读 · 0 评论 -
UVa 10340 All in all
All in all; subsequence原创 2015-02-27 18:34:14 · 413 阅读 · 0 评论 -
poj 2385 Apple Catching
分析: 题意大致为:两棵树每分钟仅有一棵会掉果子,设为Tree 1, Tree 2。可用数组记录,记为a[i][j] = 1或0。找时刻为 j 的状态,此时在树 i 上,可移动 k 次,即d[i][j][k]。 推测如何从前面的状态转移到此状态。前一状态有两种,即在j - 1时刻,这头牛要么在tree 1,要么在tree 2。可得状态转移方程:d[i][j][k] = max(d[i]原创 2015-06-19 00:24:05 · 257 阅读 · 0 评论 -
dp小结
5道基础dp题原创 2015-06-30 11:59:38 · 280 阅读 · 0 评论 -
POJ 1017 Packets 简单模拟
用1×1至6×6这六种正方形拼出尽可能少的6×6的正方形。原创 2015-10-06 00:04:43 · 298 阅读 · 0 评论