Submission #940250

#	Time	Username	Problem	Language	Result	Execution time	Memory
940250		Sundavar	Financial Report (JOI21_financial)	C++14	100 / 100	289 ms	38488 KiB

Main

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


struct dat{
    int price, len, id;
    bool operator < (dat a) const{
        return a.price > price;
    }
};

int main(){
    int n, d;
    cin>>n>>d;
    vector<int> used(n, -1), price(n);
    set<dat> best;
    best.insert({-1,0, -1});
    multiset<int> el;
    for(int i = 0; i < n; i++){
        cin>>price[i];
        if(i > d){
            el.erase(el.find(price[i-d-1]));
            while(best.size() > 1){
                auto it = next(best.begin());
                if(it->price < *el.begin()) best.erase(it);
                else break;
            }
        }
        
        auto it = best.lower_bound({price[i], -1, -1}), p = prev(it);
        el.insert({price[i]});
        if(it != best.end() && it->price == price[i]) continue;
        if(it != best.end() && it->len == p->len+1) best.erase(it);
        best.insert({price[i], p->len+1, i});
    }   
    cout << prev(best.end())->len << "\n";
}

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