| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1359894 | Peti | Global Warming (CEOI18_glo) | C++20 | 2096 ms | 2756 KiB |
#include <bits/stdc++.h>
using namespace std;
int calc_lis(const vector<int> &v) {
vector<int> dp(v.size(), 1);
int res = 0;
for(int i = 0; i < (int)v.size(); i++) {
for(int j = 0; j < i; j++) {
if(v[j] < v[i]) dp[i] = max(dp[i], dp[j] + 1);
}
res = max(res, dp[i]);
}
return res;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, d;
cin>>n>>d;
vector<int> v(n);
for(auto &x : v) cin>>x;
int ans = 0;
for(int x = -d; x <= d; x++) {
vector<int> tmp = v;
for(int l = 0; l < n; l++) {
tmp[l] += x;
for(int r = l + 1; r <= n; r++) {
ans = max(ans, calc_lis(tmp));
tmp[r] += x;
}
}
}
cout << ans << '\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... | ||||
