# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
996611 | 2024-06-10T22:35:01 Z | oj123 | Rabbit Carrot (LMIO19_triusis) | C++14 | 0 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define f first #define s second int main() { int n,m; cin >> n >> m; vector<ll> v; v.pb(0); for (int i=1;i<=n;i++){ ll a; cin >> a; v.pb((a-(m*i))*-1); } vector<ll> v1; for (int i:v){ int pos=lower_bound(v1.begin(),v1.end(),i)-v1.begin(); if (pos==v1.size()){ v1.pb(i); }else{ v1[pos]=i; } } cout << endl; cout << n-v1.size()+((v[1]<0)?1:0) << endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |