# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850612 | StefanSebez | Cat Exercise (JOI23_ho_t4) | C++14 | 175 ms | 35260 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 fi first
#define se second
#define ll long long
const int N=2*1e5+50;
map<pair<int,int>,int>mapa;
ll dp[N];
int main()
{
int n;scanf("%i",&n);
int a[n+1],L[n+1],R[n+1];
vector<int>mono;
for(int i=1;i<=n;i++)
{
L[i]=0,R[i]=n+1;
scanf("%i",&a[i]);
while(!mono.empty() && a[mono.back()]<a[i])
{
R[mono.back()]=i;
mono.pop_back();
}
if(!mono.empty()) L[i]=mono.back();
mono.push_back(i);
}
pair<int,int>par[n+1];
for(int i=1;i<=n;i++)
{
mapa[{L[i],R[i]}]=i;
par[i]=make_pair(R[i]-L[i],i);
}
sort(par+1,par+n+1);
for(int i=1;i<=n;i++)
{
int j=par[i].se,maks=0,l=mapa[{L[j],j}],r=mapa[{j,R[j]}];
if(j-L[j]>1)dp[j]=max(dp[l]+j-l,dp[j]);
if(R[j]-j>1)dp[j]=max(dp[r]+r-j,dp[j]);
}
for(int i=1;i<n;i++)
{
int u,v;
scanf("%i%i",&u,&v);
}
printf("%lld\n",dp[mapa[{0,n+1}]]);
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... |