Submission #734438

#	Time	Username	Problem	Language	Result	Execution time	Memory
734438		farica	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	0 ms	212 KiB

triusis

#include <bits/stdc++.h>
#define div /
#define ll long long

#define fore(i, l, r) for(int i=int(l); i<int(r); i++)
#define sz(a) int((a).size())
#define mod 1000000007

using namespace std;

int main() {
    int n,m,cnt=0;
    cin >> n >> m;
    int h[n];
    vector<int>v;
    for(int i=0; i<n; ++i) {
        cin >> h[i];
        if(!i && h[i]>m) {
            h[i]=m;
            cnt=1;
        }
        v.insert(v.begin(), h[i]-m*i);
    }
    vector<int>dp;
    dp.push_back(v[0]);
    for(int i=1; i<n; ++i) {
        int pos=upper_bound(dp.begin(), dp.end(), v[i])-dp.begin();
        if(i==n-1) {
            if(pos==(int)dp.size()) cout << n-(int)dp.size()+cnt-1 << endl;
            else cout << n-pos-1+cnt << endl;
        }
        if(pos==(int)dp.size()) dp.push_back(v[i]);
        else dp[pos]=v[i];
    }
    return 0;
}

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