Submission #916497

#TimeUsernameProblemLanguageResultExecution timeMemory
916497Darren0724Cat Exercise (JOI23_ho_t4)C++17
7 / 100
21 ms464 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define all(x) x.begin(),x.end() #define abcorz ios_base::sync_with_stdio(false);cin.tie(0); int32_t main(){ abcorz; int n;cin>>n; vector<int> v(n),t(n+1); for(int i=0;i<n;i++){ cin>>v[i]; t[v[i]]=i; } int ans=0; for(int i=0;i<n;i++){ for(int j=i;j<n;j++){ int l=i,r=j; int last=-1; int cnt=0; for(int k=n;k>=1;k--){ if(t[k]>=l&&t[k]<=r){ if(last==-1){ last=t[k]; continue; } cnt+=abs(last-t[k]); if(last>t[k]){ r=last; } else{ l=last; } last=t[k]; } } ans=max(ans,cnt); } } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...