码迷,mamicode.com
首页 >  
搜索关键字:distinct subsequence    ( 4379个结果
poj 1094 / zoj 1060 Sorting It All Out
Sorting It All OutTime Limit:1000MSMemory Limit:10000KTotal Submissions:26876Accepted:9271DescriptionAn ascending sorted sequence of distinct values i...
分类:其他好文   时间:2014-07-19 15:03:58    阅读次数:278
POJ 3687:Labeling Balls(优先队列+拓扑排序)
Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10178 Accepted: 2815 Description Windy has N balls of distinct weights from 1 un...
分类:其他好文   时间:2014-07-19 02:26:55    阅读次数:224
C_Dp
/* 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
POJ 1094: Sorting It All Out( 拓扑排序 )
Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 26866 Accepted: 9267 Description An ascending sorted sequence of distinct values...
分类:其他好文   时间:2014-07-18 11:33:31    阅读次数:294
Codeforces Round #256 (Div. 2) B
B. Suffix Structures Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team. At a competition the "Bizons" got the following problem: "You are given two distinct w...
分类:其他好文   时间:2014-07-18 11:15:25    阅读次数:252
poj1458 dp入门
Common SubsequenceTime Limit:1000MSMemory Limit:10000KTotal Submissions:37551Accepted:15023DescriptionA subsequence of a given sequence is the given s...
分类:其他好文   时间:2014-07-18 10:02:42    阅读次数:169
[ACM] POJ 3687 Labeling Balls (拓扑排序,逆向建边)
Labeling Balls Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10161   Accepted: 2810 Description Windy has N balls of distinct weights from 1 unit to N ...
分类:其他好文   时间:2014-07-17 16:28:48    阅读次数:261
LeetCode——Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4->5, return 1->2->5. Given 1->1-...
分类:其他好文   时间:2014-07-16 17:30:52    阅读次数:230
POJ 2299 Ultra-QuickSort
Ultra-QuickSort Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence eleme...
分类:其他好文   时间:2014-07-16 09:00:13    阅读次数:240
I深搜
/* I - 深搜 基础 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description Given a specified total t and a list of n integers, find all distinct sums using n...
分类:其他好文   时间:2014-07-14 13:10:00    阅读次数:253
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!