# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609431 | 2022-07-27T15:35:16 Z | alexz1205 | Rabbit Carrot (LMIO19_triusis) | C++14 | 0 ms | 212 KB |
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, m; cin >> n >> m; int nums[n]; for (int x = 0; x < n; x ++){ int a; cin >> a; nums[x] = m * (x+1) + a; } vector<int> seq; for (int x = 0; x < n; x ++){ int i = lower_bound(seq.begin(), seq.end(), nums[x]) - seq.end(); if (i == seq.size()){ seq.push_back(nums[x]); }else { seq[i] = nums[x]; } } cout << seq.size() << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |