/*
C - 简单dp 例题
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
A subsequence of a given sequence is the given sequence with some elements (poss...
分类：
其他好文 时间：
2014-07-18 22:28:24
阅读次数：
206
题目来源，待字闺中，原创@陈利人
，欢迎大家继续关注微信公众账号“待字闺中”
原题这个LIS问题，可不是Longest Increasing Subsequence，而是Largest Independent Set，含义如下：给定一棵二叉树，找到满足如下条件的最大节点集合：集合中的任意两个节点之间，都没有边。如下图：
LIS大小为5，为{10,40,60,70,8...
分类：
其他好文 时间：
2014-07-12 23:20:18
阅读次数：
267
Distinct SubsequencesGiven a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is...
分类：
其他好文 时间：
2014-07-12 13:37:37
阅读次数：
141
DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence....
分类：
其他好文 时间：
2014-07-11 11:28:14
阅读次数：
269
Longest Ordered Subsequence
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 31787
Accepted: 13903
Description
A numeric sequence of ai is ordered if a1 a2...
分类：
其他好文 时间：
2014-07-10 20:27:45
阅读次数：
202
Find a maximum sum of a compact subsequence of array elements and any double slice.
分类：
其他好文 时间：
2014-07-06 20:44:45
阅读次数：
351
Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig...
分类：
其他好文 时间：
2014-07-06 16:01:23
阅读次数：
203
Longest Ordered Subsequence
Longest Ordered Subsequence
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 31680
Accepted: 13848
Description
A nu...
分类：
其他好文 时间：
2014-07-06 00:04:50
阅读次数：
236
Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig...
分类：
其他好文 时间：
2014-07-04 00:12:20
阅读次数：
249
Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig...
分类：
其他好文 时间：
2014-07-03 13:05:28
阅读次数：
210
