oj.uz

Submission #786654

# Submission time Handle Problem Language Result Execution time Memory
786654 2023-07-18T10:57:12 Z nonono Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN = 2e5 + 10;
int n, m;
int h[mxN];

signed main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr);
    
    cin >> n >> m;
    
    for(int i = 1; i <= n; i ++) cin >> h[i];
    
    for(int i = 1; i <= n; i ++) {
        h[i] = h[i] - i * m;
    }
    
    vector<int> LIS;
    
    for(int i = n; i >= 1; i --) {
        int x = upper_bound(LIS.begin(), LIS.end(), h[i]) - LIS.begin();
        if(x == LIS.size()) LIS.push_back(h[i]);
        else 
            LIS[x] = min(LIS[x], h[i]);
    }
    
    cout << n - LIS.size() << "\n";
    return 0;
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:24:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         if(x == LIS.size()) LIS.push_back(h[i]);
      |            ~~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -