Submission #1277557

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277557		kamal	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	20 ms	4180 KiB

triusis

#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <cstring>
#include <vector>
#include <array>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <thread>
#include <mutex>
#include <bitset>
#include <atomic>
#include <future>
#include <chrono>
#include <ctime>
#include <random>
#include <cstdlib>
#include <cassert>
#include <exception>
using namespace std;

#define int long long
#define SALAM ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'

signed main(){
    /*|||\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||*/
    /*|||\/\/\/\/\*/SALAM/*/\/\/\/\/\/\|||*/
    /*|||\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||*/
    int n , m;
    cin >> n >> m;
    vector<long long> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    vector<long long> d;
    for(int i = 0; i < n; i++){
        long long w = (long long) m * (i + 1) - a[i];
        if(w >= 0){
            auto it = upper_bound(d.begin() , d.end() , w);
            if(it == d.end()) d.push_back(w);
            else d[it - d.begin()] = w;
        }
    }
    cout << n - d.size() << endl;
}

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