Dreamlandz的博客

有两种方法求最长上升子序列。 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;

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