제출 #891300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891300		SorahISA	Financial Report (JOI21_financial)	C++17	65 / 100	4065 ms	8312 KiB

Main

#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

void solve() {
    int N, D; cin >> N >> D;
    
    vector<int> A(N);
    for (int &x : A) cin >> x;
    
    
    if (D == 1) {
        
        int ans = 1;
        deque<int> stk;
        for (int i = N-1; i >= 0; --i) {
            while (SZ(stk) and A[i] >= stk[0]) stk.pf();
            stk.ef(A[i]);
            chmax(ans, SZ(stk));
        }
        cout << ans << "\n";
        
    }
    else if (D == N) {
        
        reverse(ALL(A));
        for (int &x : A) x *= -1;
        
        vector<int> lis{0};
        for (int x : A) {
            if (x > lis.back()) lis.eb(x);
            else *lower_bound(ALL(lis), x) = x;
        }
        cout << SZ(lis) << "\n";
        
    }
    else {
        
        vector<int> dp(N, 1);
        for (int i = N-1; i >= 0; --i) {
            for (int j = i+1, cnt = 1; cnt <= D and j < N; ++j, ++cnt) {
                    if (A[j] >  A[i]) chmax(dp[i], dp[j] + 1);
                else if (A[j] == A[i]) chmax(dp[i], dp[j]), cnt = 0;
                else if (A[j] <  A[i]) cnt = 0;
            }
            // debug(i, A[i], dp[i]);
        }
        cout << *max_element(ALL(dp)) << "\n";
        
    }
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        solve();
    }
    
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using int64 = long long;
#define int int64
using float80 = long double;
#define double float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "\u001b[33m"), \
    fprintf(stderr, "At [%s], line %d: (%s) = ", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), \
    fprintf(stderr, "\u001b[0m")
template <typename T> void _do(T &&_t) { cerr << _t << "\n"; }
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) { cerr << _t << ", ", _do(_u...); }
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

template <typename T, typename U> bool chmin(T &lhs, U rhs) { return lhs > rhs ? lhs = rhs, 1 : 0; }
template <typename T, typename U> bool chmax(T &lhs, U rhs) { return lhs < rhs ? lhs = rhs, 1 : 0; }

#endif

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 12 / 12
• Subtask 5: 5 / 5
• Subtask 6: 0 / 35