2015年05月__pkm_

原创 G - Power Strings POJ 2406 （字符串的周期）

G - Power StringsTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2406DescriptionGiven two strings a and b we define a*b to be their concatenati

2015-05-27 18:34:57 1481

原创 R - Milking Time POJ 3616 ( DP )

R - Milking TimeTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3616DescriptionBessie is such a hard-working cow. In fact, she is so focused

2015-05-21 11:21:18 603

原创 Q - Phalanx HDU 2859 ( dp )

Q - PhalanxTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2859DescriptionToday is army day, but the servicemen are busy with the phalanx for t

2015-05-17 14:43:47 875

转载 Arduino 基本语法

这里给你提供一个Arduino语法函数的操作指令讲解。详细内容请参考：http://arduino.cc/en/Reference/HomePage程序结构一个Arduino程序分为两部分：void setup（）在这个函数里防止初始化Arduino的程序，使主循环程序在开始之前设置好相关参数。void loop（）这是Arduino的主函数

2015-05-12 19:41:40 22207

原创 P - FatMouse and Cheese HDU 1078 ( 记忆化搜索 )

P - FatMouse and CheeseTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1078DescriptionFatMouse has stored some cheese in a city. The city can b

2015-05-10 13:04:04 604

原创 O - Treats for the Cows POJ 3186 ( 动态规划+区间 )

O - Treats for the CowsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3186DescriptionFJ has purchased N (1 The treats are interesting for

2015-05-07 20:30:50 950 2

原创 M - Help Jimmy POJ 1661 ( 动态规划 )

M - Help JimmyTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1661Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零

2015-05-07 18:02:19 612

原创 #1162 : 骨牌覆盖问题·三

#1162 : 骨牌覆盖问题·三时间限制:10000ms单点时限:1000ms内存限制:256MB描述前两周里，我们讲解了2xN,3xN骨牌覆盖的问题，并且引入了两种不同的递推方法。这一次我们再加强一次题目，对于给定的K和N，我们需要去求KxN棋盘的覆盖方案数。提示：KxN骨牌覆盖输入第1行：2个整数N。表示棋盘宽度为k，长度为N。2≤K≤7，1

2015-05-03 10:48:51 844

原创 N - Longest Ordered Subsequence POJ 2533 （最长上升子序列）

N - Longest Ordered SubsequenceTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2533DescriptionA numeric sequence of ai is ordered if a1 < a2 <

2015-05-02 10:48:35 719

qwesde