| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1359888 | Peti | Global Warming (CEOI18_glo) | C++20 | 52 ms | 2312 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, d;
cin>>n>>d;
vector<int> v(n);
for(auto &x : v) cin>>x;
vector<int> lis1 = {}, lis2 = {};
for(int x : v) {
auto it2 = lower_bound(lis2.begin(), lis2.end(), x + d);
if(it2 == lis2.end()) lis2.push_back(x + d);
else *it2 = x + d;
auto it1 = lower_bound(lis1.begin(), lis1.end(), x);
int idx = it1 - lis1.begin();
if(it1 == lis1.end()) lis1.push_back(x);
else *it1 = x;
lis2[idx] = min(lis2[idx], x);
// for(int y : lis1) cout << y << ' ';
// cout << '\n';
// for(int y : lis2) cout << y << ' ';
// cout << '\n';
// cout << "-------------\n";
}
cout << lis2.size() << '\n';
return 0;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
