Submission #959183

#	Time	Username	Problem	Language	Result	Execution time	Memory
959183		lalig777	Savez (COCI15_savez)	C++14	48 / 120	1082 ms	14564 KiB

savez

#include <iostream>
#include <vector>
using namespace std;


int main(){
    int n;
    cin>>n;
    vector<string>v(n+1);
    v[0]="";
    vector<int>dp(n+1, 0);
    int ans=0;
    for (int i=1; i<=n; i++){
        cin>>v[i];
        int siz2=v[i].size();
        for (int j=0; j<i; j++){
            string s=v[j];
            int siz=s.size();
            bool bien=true;
            for (int k=0; k<siz; k++){
                if (s[k]!=v[i][k] or s[k]!=v[i][siz2-siz+k]){
                    bien=false;
                    break;
                }
            }if (bien==true) dp[i]=max(dp[i], dp[j]+1);
        }ans=max(ans, dp[i]);
    }cout<<ans<<endl;
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12