Submission #1173269

#TimeUsernameProblemLanguageResultExecution timeMemory
1173269ezzzaySavez (COCI15_savez)C++20
0 / 120
0 ms328 KiB

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=504;
int dp[N];
string s[N];
signed main(){
    cout<<3;
    return 0;
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i];
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        dp[i]=1;
        for(int j=1;j<i;j++){
            int h=s[j].size();
            bool u=0;
            if(s[i].substr(0,h)==s[j] and s[j]==s[i].substr((int)s[i].size()-h,h)){
                u=1;
            }
            dp[i]=max(dp[i],dp[j]+ u);
            ans=max(ans,dp[i]);
        }
    }
    cout<<ans;
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...