【动态规划】[luoguP2008]大朋友的数字

题目

变形的最长不下降子序列 我们用一个数组b维护当前可取的最长长度就好了 题目中要求取字典序最小的其实就是废话 要是去最大的可能还得想想怎么取qwq 思路来自Du.ZY

代码如下

#include<iostream>
#include<cstdio>
#include<cctype>

    using namespace std;
    #define in = read();
    typedef long long ll;
    typedef unsigned int ui;
    const ll size = 10000 + 100;

        ui n;
        ui a[size];
        ui f[size] , b[size];

inline ll read(){
        ll num = 0 , f = 1;    char ch = getchar();

        while(!isdigit(ch)){
                if(ch == '-')   f = -1;
                ch = getchar();
        }
        while(isdigit(ch)){
                num = num*10 + ch - '0';
                ch = getchar();
        }

        return num*f;
}

int main(){
        n in;
        for(register int i=1;i<=n;i++)    a[i] in;    

        b[1] = 1;   f[1] = a[1];
        for(register int i=2;i<=n;i++){
                b[i] = 1;
                for(register  int j=1;j<i;j++)
                        if(a[j] <= a[i])
                                if(b[j] + 1 > b[i]){
                                        b[i] = b[j] + 1;
                                        f[i] = f[j];
                                }
                f[i] += a[i];                
        }

        for(register int i=1;i<=n;i++)
                printf("%d " , f[i]);
}


//COYG