码迷,mamicode.com
首页 >  
搜索关键字:maximum subsequence    ( 5146个结果
【LeetCode】Distinct Subsequences
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
Poj 1458 Common Subsequence(LCS)
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
poj 2533 Longest Ordered Subsequence
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
Best Time to Buy and Sell Stock II
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类:其他好文   时间:2014-07-09 23:32:44    阅读次数:276
[leetcode] Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
分类:其他好文   时间:2014-07-08 00:41:49    阅读次数:235
【题解】【数组】【Prime and composite numbers】【Codility】Flags
Find the maximum number of flags that can be set on mountain peaks.
分类:其他好文   时间:2014-07-06 15:07:09    阅读次数:371
[Leetcode][Tree][Binary Tree Maximum Path Sum]
找书中权值和最大的路径,至少包含一个点。有点类似LCA(最近公共祖先),树的问题关键是如何划分子问题,然后递归求解。想到了可以返回两种结果,一个是单独路径的最大和,一种是子树的最大和,然后在求解的过程中不断的更新答案。 1 /** 2 * Definition for binary tree 3 ....
分类:其他好文   时间:2014-07-06 14:16:47    阅读次数:187
LeetCode——Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 给定一个字符串S,找出其中的最长回文...
分类:其他好文   时间:2014-07-06 00:15:15    阅读次数:240
POJ2533:Longest Ordered Subsequence
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
POJ 3693 Maximum repetition substring (后缀数组)
题目大意: 求出字典序最小,重复次数最多,的子串。 思路分析: RMQ + height 数组可以求出任意两个后缀的lcp 我们枚举答案字符串的重复的长度。 如果这个字符串的长度为 l ,而且这个字符串出现过两次或两次以上 那么你会发现在原串中  str[0] str[l] str[2*l] ....肯定有相邻的两个被包含在重复的串中。 我们求出这两个相邻的后缀的lcp 我...
分类:其他好文   时间:2014-07-05 23:47:48    阅读次数:178
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!