제출 #1159291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159291		brinton	Financial Report (JOI21_financial)	C++20	48 / 100	4094 ms	2764 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    //start here
    int N,D;
    cin >> N >> D;
    vector<int> v(N);
    for(auto &i:v)cin >> i;

    vector<int> LIS;
    deque<pair<int,int>> dq;// {val,idx}, val遞增，idx遞增
    for(int i = 0;i < N;i++){
        // set LIS to range min
        // change mustWalk to deque
        if(i != 0){// i == 0, dq is empty and there is nothing change
            while(dq.front().second < i-D)dq.pop_front();
            int mustWalk = dq.front().first;
            
            for(auto &j:LIS){
                j = max(j,mustWalk);
            }
        }
        auto it = lower_bound(LIS.begin(),LIS.end(),v[i]);
        if(it == LIS.end()){
            LIS.push_back(v[i]);
        }else{
            *it = v[i];
        }
        // for(auto i:LIS)cout << i << " ";cout << endl;
        // push cur to deque
        while(!dq.empty() && dq.back().first >= v[i]) dq.pop_back();
        dq.push_back({v[i],i});
    }
    cout << LIS.size();
}

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