제출 #731513

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
731513		hafo	Global Warming (CEOI18_glo)	C++14	0 / 100	81 ms	5492 KiB

glo

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e17 + 69;

int n, x, a[maxn], dp[maxn];

struct BIT {
    int bit[maxn];

    void init() {
        fill_n(bit, n + 1, 0);
    }

    void update(int x, int val) {
        for(; x <= n; x += x&-x) maxi(bit[x], val);
    }

    int get(int x) {
        int ans = 0;
        for(; x; x-= x&-x) maxi(ans, bit[x]);
        return ans;
    }
} bit;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>x;
    vector<int> val;
    for(int i = 1; i <= n; i++) {
        cin>>a[i];
        val.pb(a[i]);
    }
    sort(all(val));
    for(int i = 1; i <= n; i++) a[i] = lower_bound(all(val), a[i]) - val.begin() + 1;
    dp[n + 1] = 1;
    for(int i = n; i >= 1; i--) {
        dp[i] = max(dp[i + 1], bit.get(n - a[i]) + 1);
        bit.update(n - a[i] + 1, dp[i]);
    }

    bit.init();
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        int cur = bit.get(a[i] - 1) + 1;
        bit.update(a[i], cur);
        maxi(ans, cur + dp[i] - 1);
    }
    cout<<ans;
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25