Submission #848618

#	Time	Username	Problem	Language	Result	Execution time	Memory
848618		Darren0724	Round words (IZhO13_rowords)	C++17	24 / 100	2100 ms	12380 KiB

rowords

#include <bits/stdc++.h>
using namespace std;
const int N=2005;
int dp[N][N];
int n,m;
string a,b;
int solve(){
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i-1]==b[j-1]){
                dp[i][j]=dp[i-1][j-1]+1;
            }
            else{
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
            ans=max(ans,dp[i][j]);
        }
    }
    return ans;
}
int32_t main() {
    cin>>a>>b;
    n=a.size();
    m=b.size();
    int ans=0;
    for(int i=0;i<n;i++){
        ans=max(ans,solve());
        rotate(a.begin(),a.begin()+1,a.end());
    }
    reverse(a.begin(),a.end());
    for(int i=0;i<n;i++){
        ans=max(ans,solve());
        rotate(a.begin(),a.begin()+1,a.end());
    }
    cout<<ans<<endl;
    return 0;
}

• Subtask 1: 24 / 100