题目连接 nlogn求一下LIS 就好了 #include<cstdio>#include<algorithm>#include<iostream>using namespace std;#define cl(a,b) memset(a,b,sizeof(a))#define LL long long#define pb push_back#define gcd __gcd#de

Bellovin 题意：给出序列a[ ]，求f[ ],f[i]指到i最小LIS。 题解：LIS变形，设定一个数组b[ ],每查找一次，把a[i]加入b[ j],j为找到的子序列长度。 <span style="font-size:18px;">#include<cstdio>#include<algorithm>#define INF 0x3f3f3f3fusing na

Bellovin Accepts: 428 Submissions: 1685 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) 问题描述 Peter有一个序列a_1,a_2,...,a_na​1​​,a​2​​,...,a​n