Submission #955228

#	Time	Username	Problem	Language	Result	Execution time	Memory
955228		Akshat369	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	24 ms	8400 KiB

triusis

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF (int)1e18
#define endl '\n'
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
#define f first
#define s second
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define rrep(i, a, b) for(int i = (a); i > (b); i--)
#define vi vector<int>
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()


mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

/*

*/

void Solve() {
    int n , h ; cin>>n>>h;
    vi a(n+1);
    for (int i = 1; i <= n; ++i) {
        cin>>a[i];
    }
    vector<int> temp;
    rep(i,1,n+1){
        if (a[i]<=i*h){
            temp.push_back(i*h - a[i]);
        }
    }
    vi lis;
    for (int i = 0; i < (int)temp.size(); ++i) {
        auto lb = upper_bound(lis.begin(), lis.end(),temp[i]);
        if (lb==lis.end()){
            lis.push_back(temp[i]);
        }
        else{
            *lb = temp[i];
        }
    }
    cout<< n- lis.size()<<endl;
}

int32_t main() {
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(0);


    int t = 1;
 //   cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37