| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 550275 | Hanksburger | Global Warming (CEOI18_glo) | C++17 | 58 ms | 4256 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 <bits/stdc++.h>
using namespace std;
int a[200005], lis[200005];
vector<int> vec;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, ans=0;
cin >> n >> m;
for (int i=1; i<=n; i++)
{
cin >> a[i];
int index=lower_bound(vec.begin(), vec.end(), a[i])-vec.begin();
if (index==vec.size())
vec.push_back(a[i]);
else
vec[index]=a[i];
lis[i]=index+1;
}
vec.clear();
for (int i=n; i>=1; i--)
{
int index=lower_bound(vec.begin(), vec.end(), -a[i]+m)-vec.begin();
ans=max(ans, lis[i]+index);
index=lower_bound(vec.begin(), vec.end(), -a[i])-vec.begin();
if (index==vec.size())
vec.push_back(-a[i]);
else
vec[index]=-a[i];
}
cout << ans;
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
