oj.uz

답안 #330094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330094 2020-11-23T22:35:43 Z alien_lover Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 364 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>

using namespace std;

typedef long long ll;

#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()

const int PRIME = 1e9 + 7;


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n;
    ll m;
    cin >> n >> m;
    
    vector<ll> alteredHeights(n);

    for(int i = 0; i < n; i++){
        ll h;
        cin >> h;
        alteredHeights[i] = m * (i+1) - h;
    }

    vector<ll> dp;
    dp.push_back(LLONG_MIN);

    for(int i = 0; i < n; i++){
        if(alteredHeights[i] < 0){
            continue;
        }
        int ind = upper_bound(dp.begin(), dp.end(), alteredHeights[i]) - dp.begin();
        if(ind == sz(dp)){
            dp.push_back(0);
        }else{
            dp[ind] = alteredHeights[i];
        }
    }

    cout << n - dp.size() + 1 << '\n';
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -