2013年9月8日
poj-------Common Subsequence(poj 1458)
摘要： Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 34477Accepted: 13631DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exists a strictly .. 阅读全文
posted @ 2013-09-08 16:09 龚细军 阅读(334) 评论(0) 推荐(0)
poj----Maximum sum(poj 2479)
摘要： Maximum sumTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 30704Accepted: 9408DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:Your task is to calculate d(A).InputThe input consists of T( 2 #include 3 #define maxn 50001 4 #include 5 using namespac 阅读全文
posted @ 2013-09-08 15:48 龚细军 阅读(563) 评论(0) 推荐(0)