| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1019090 | ivaziva | Global Warming (CEOI18_glo) | C++14 | 65 ms | 7048 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;
#define MAXN 200010
long long n,x;
long long a[MAXN],b[MAXN];
long long lis1[MAXN],lis2[MAXN];
vector<long long> dp;
int main()
{
cin>>n>>x;
for (long long i=1;i<=n;i++) cin>>a[i];
for (long long i=1;i<=n;i++)
{
long long pos=lower_bound(dp.begin(),dp.end(),a[i])-dp.begin();lis1[i]=pos+1;
if (pos==dp.size()) dp.push_back(a[i]);
else dp[pos]=a[i];
}
dp.clear();
for (long long i=n;i>=1;i--)
{
long long pos1=lower_bound(dp.begin(),dp.end(),x-a[i])-dp.begin();lis2[i]=pos1+1;
long long pos2=lower_bound(dp.begin(),dp.end(),a[i]*(-1))-dp.begin();
if (pos2==dp.size()) dp.push_back(a[i]*(-1));
else dp[pos2]=a[i];
}
long long ans=lis1[n];
for (long long i=1;i<n;i++)
{
long long lis=lis1[i]+lis2[i]-1;
ans=max(ans,lis);
}
cout<<ans<<endl;
}
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... | ||||
