Submission #1098246

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098246		LilPluton	Financial Report (JOI21_financial)	C++14	48 / 100	4034 ms	18000 KiB

Main

#include <bits/stdc++.h>
using namespace std;
template<typename T> bool umax(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool umin(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
 
const int sz = 1e6 + 5;
#define int long long
 
 
struct DSU{
 
    vector<int>e;
    DSU(int n){
        e.assign(n + 1, -1);
    }
    int _find(int v){
        if(e[v] < 0){
            return v;
        }
        return e[v] = _find(e[v]);
    }
    int _union(int u,int v){
        u = _find(u);
        v = _find(v);
        if(u != v){
            if(e[u] > e[v]){
                swap(u, v);
            }
            e[u] += e[v];
            e[v] = u;
            return 1;
        }
        return 0;
    }
 
};

vector<int>a(sz), dp(sz, 1);
 
void test_case(int testcase){
    int n, d;
    cin >> n >> d;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i){
        int id = i;
        for(int j = i; j >= 1; --j){
            if(id - j > d){
                break;
            }
            if(a[i] > a[j]){
                dp[i] = max(dp[i], dp[j] + 1);
            }
            if(a[i] >= a[j]){
                id = j;
            }
        }
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
}
 
signed main(){
    int T = 1;
    for(int test = 1; test <= T; ++test){
        test_case(test);
    } 
}
 
/*
    
*/

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