2016年4月19日
Problem L
摘要： ProblemDescription在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n,输出铺放方案的总数.例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图：L" title="Problem L">Input输入数据由多行组成，每行包含一个整数n,表示该测试实例的长方... 阅读全文
posted @ 2016-04-19 21:48 勿忘初心0924 阅读(112) 评论(0) 推荐(0)
Problem L
摘要： ProblemDescription在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n,输出铺放方案的总数.例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图：L" title="Problem L">Input输入数据由多行组成，每行包含一个整数n,表示该测试实例的长方... 阅读全文
posted @ 2016-04-19 21:48 勿忘初心0924 阅读(122) 评论(0) 推荐(0)
Problem B
摘要： Problem DescriptionA subsequence of a given sequence is the givensequence with some elements (possible none) left out. Given asequence X = another ... 阅读全文
posted @ 2016-04-19 15:20 勿忘初心0924 阅读(115) 评论(0) 推荐(0)
Problem B
摘要： Problem DescriptionA subsequence of a given sequence is the givensequence with some elements (possible none) left out. Given asequence X = another ... 阅读全文
posted @ 2016-04-19 15:20 勿忘初心0924 阅读(142) 评论(0) 推荐(0)
Problem A
摘要： Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], yourjob is to calculate the max sum of a sub-sequence. For example,given (6,-1,5,4,-7... 阅读全文
posted @ 2016-04-19 15:17 勿忘初心0924 阅读(145) 评论(0) 推荐(0)
Problem A
摘要： Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], yourjob is to calculate the max sum of a sub-sequence. For example,given (6,-1,5,4,-7... 阅读全文
posted @ 2016-04-19 15:17 勿忘初心0924 阅读(596) 评论(0) 推荐(0)