最长上升子序列
Dreamlandzxx
这个作者很懒,什么都没留下…
展开
-
最长上升子序列(单点递增子序列)
有两种方法求最长上升子序列。 1:时间复杂度为O(n^2)#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#include<iostream>using namespace std;char a[100001];int hp[100001];int main(){ int t;原创 2016-07-26 09:10:16 · 459 阅读 · 0 评论 -
Beautiful People ZOJ - 2319(单调递增子序列,记录路径)
The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbered by the time they enter原创 2017-04-18 21:45:59 · 389 阅读 · 0 评论