What Goes Up UVA - 481 LIS+打印路径【模板】

刺骨的言语ヽ痛彻心扉 2021-12-16 20:01 185阅读 0赞

**打印严格上升子序列；**

#include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstdlib>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<map>
    #include<set>
    #include<vector>
    #include<queue>
    #include<bitset>
    #include<ctime>
    #include<time.h>
    #include<deque>
    #include<stack>
    #include<functional>
    #include<sstream>
    //#include<cctype>
    //#pragma GCC optimize(2)
    using namespace std;
    #define maxn 200005
    #define inf 0x7fffffff
    //#define INF 1e18
    #define rdint(x) scanf("%d",&x)
    #define rdllt(x) scanf("%lld",&x)
    #define rdult(x) scanf("%lu",&x)
    #define rdlf(x) scanf("%lf",&x)
    #define rdstr(x) scanf("%s",x)
    #define mclr(x,a) memset((x),a,sizeof(x))
    typedef long long  ll;
    typedef unsigned long long ull;
    typedef unsigned int U;
    #define ms(x) memset((x),0,sizeof(x))
    const long long int mod = 9999973;
    #define Mod 1000000000
    #define sq(x) (x)*(x)
    #define eps 1e-5
    typedef pair<int, int> pii;
    #define pi acos(-1.0)
    //const int N = 1005;
    #define REP(i,n) for(int i=0;i<(n);i++)
    typedef pair<int, int> pii;
    
    inline int rd() {
    	int x = 0;
    	char c = getchar();
    	bool f = false;
    	while (!isdigit(c)) {
    		if (c == '-') f = true;
    		c = getchar();
    	}
    	while (isdigit(c)) {
    		x = (x << 1) + (x << 3) + (c ^ 48);
    		c = getchar();
    	}
    	return f ? -x : x;
    }
    
    
    ll gcd(ll a, ll b) {
    	return b == 0 ? a : gcd(b, a%b);
    }
    int sqr(int x) { return x * x; }
    
    
    
    /*ll ans;
    ll exgcd(ll a, ll b, ll &x, ll &y) {
    	if (!b) {
    		x = 1; y = 0; return a;
    	}
    	ans = exgcd(b, a%b, x, y);
    	ll t = x; x = y; y = t - a / b * y;
    	return ans;
    }
    */
    int n;
    int a[maxn];
    int pos[maxn];
    int dp[maxn];
    int lst[maxn];
    
    int main()
    {
    //	ios::sync_with_stdio(0);
    	int x;// n = rd();
    	n = 0;
    	while (cin >> x) {
    		n++; a[n] = x;
    	}
    	int len = 1, po = 1;
    	dp[1] = a[1]; pos[1] = 1;
    	for (int i = 2; i <= n; i++) {
    		if (a[i] > dp[len]) {
    			dp[++len] = a[i]; pos[++po] = len;
    		}
    		else {
    			int ct = lower_bound(dp + 1, dp + len + 1, a[i]) - dp;
    			dp[ct] = a[i]; pos[++po] = ct;
    		}
    	}
    	cout << len << endl;
    	puts("-");
    	int tmp = len;
    	for (int i = n; i >= 1; i--) {
    		if (pos[i] == tmp)lst[tmp--] = a[i];
    		if (tmp < 1)break;
    	}
    	for (int i = 1; i <= len; i++)printf("%d\n", lst[i]);
    	return 0;
    }

转载于:https://www.cnblogs.com/zxyqzy/p/10354475.html