# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955081 | Github | Rabbit Carrot (LMIO19_triusis) | C++17 | 21 ms | 5328 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <climits>
#include <cmath>
#include <algorithm>
#include <stack>
#include <set>
using namespace std;
#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
#define pr printf
#define sc scanf
#define fi first
#define si second
const ll MOD = 1e9+7;
const ll INF = 1e17;
void setIO(string s){
freopen((s+".in").c_str(), "r", stdin);
freopen((s+".out").c_str(), "w", stdout);
}
int find_lis(vector<int> a){
vector<int> dp;
for (int i: a){
int pos = upper_bound(dp.begin(), dp.end(), i)-dp.begin();
if (pos == dp.size()){
dp.push_back(i);
}else{
dp[pos] = i;
}
}
return dp.size();
}
int main() {
speedup
int n, m; cin >> n >> m;
vector<int> c;
for (int i = 0; i < n; i++){
int x; cin >> x;
if (m*(i+1)-x >= 0){
c.push_back(m*(i+1)-x);
}
}
cout << n-find_lis(c) << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |