oj.uz

Submission #384826

# Submission time Handle Problem Language Result Execution time Memory
384826 2021-04-02T11:20:17 Z ngpin04 Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int N = 2e5 + 5;
 
int a[N];
int n,m;
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("file.inp","r",stdin);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] -= i * m;
        a[i] = -a[i];
    }
    vector <int> lis(n + 1, 1e18 + 1);
    lis[0] = -1e18;
    int st = 1; while (a[st] > 0) st++;
    int res = 0;
    for (int i = st; i <= n; i++) {
        int len = upper_bound(lis.begin(), lis.end(), a[i]) - lis.begin();
        lis[len] = a[i];
        res = max(res, len);
        //cout << a[i] << "\n";
    }
    cout << n - res;
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory 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 #2
0 / 21.0

# Verdict Execution time Memory 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 #3
0 / 28.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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 -