# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
265106 | TadijaSebez | Sailing Race (CEOI12_race) | C++11 | 347 ms | 3152 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 pb push_back
void ckmx(int&x,int y){x=max(x,y);}
const int N=505;
vector<int> E[N];
int dp[N][N][2],n;
bool was[N][N][2];
int DP(int l,int r,int side){
if(was[l][r][side])return dp[l][r][side];
int u=side==0?l:r;
was[l][r][side]=1;
int L=side==0?(l==n?1:l+1):l;
int R=side==1?(r==1?n:r-1):r;
for(int v:E[u]){
if((l<=r&&l<=v&&r>=v)||(l>r&&(v<=r||v>=l))){
ckmx(dp[l][r][side],1+max(DP(L,v,1),DP(v,R,0)));
}
}
return dp[l][r][side];
}
int main(){
scanf("%i %*i",&n);
for(int i=1;i<=n;i++){
while(1){
int j;
scanf("%i",&j);
if(j==0)break;
E[i].pb(j);
}
}
int ans=-1,idx=0;
for(int i=1;i<=n;i++){
int now=DP(i,i==1?n:i-1,0);
if(now>ans)ans=now,idx=i;
}
printf("%i\n%i\n",ans,idx);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |