Submission #1221810

#TimeUsernameProblemLanguageResultExecution timeMemory
1221810spetrFinancial Report (JOI21_financial)C++20
5 / 100
36 ms8880 KiB
#include <bits/stdc++.h>
#include <algorithm>

using namespace std;

#define ll long long
const ll mmod = 998244353;  
#define vl vector<long long>
#define vll vector<vector<long long>>


int LIS(vl& nums) {
    vl dp;
    for (int x : nums) {
        auto it = std::lower_bound(dp.begin(), dp.end(), x);
        if (it == dp.end())
            dp.push_back(x);
        else
            *it = x;
    }
    return dp.size();
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, d;
    cin >> n >> d;

    vl nums;
    for (ll i = 0; i < n; i++){
        ll num;
        cin >> num;
        nums.push_back(num);
    }

    if (d == 1){
        ll maximum = 0;
        ll c = 0;

        for (ll i = 0; i < n; i++){
            if (nums[i] > maximum){
                maximum = nums[i];
                c ++;
            }

        }
        cout << c << "\n";
    }
    else if (d == n){
        cout << LIS(nums) << "\n";
    }


    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...