oj.uz

Submission #734438

# Submission time Handle Problem Language Result Execution time Memory
734438 2023-05-02T12:01:21 Z farica Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 0 ms 212 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -