제출 #959203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959203		Ariadna	Savez (COCI15_savez)	C++14	0 / 120	1053 ms	46672 KiB

savez

#include <bits/stdc++.h>

using namespace std;

vector<int> dp;
int solve(int i, int n, vector<string>& x) {
    if (dp[i] != -1) return dp[i];
    dp[i] = 1;
    bool control = true;
    for (int j = i+1; j < n && control; ++j) {
        if ((int)x[i].size() > (int)x[j].size()) continue;
        bool prefix = true, suffix = true;
        for (int k = 0; k < (int)x[i].size() && prefix; ++k) {
            if (x[j][k] > x[i][k]) {
                control = false;
                prefix = false;
            } else if (x[j][k] < x[i][k]) prefix = false;
        }
        if (!prefix) continue;
        for (int k = 0; k < (int)x[i].size() && suffix; ++k) {
            if (x[j][(int)x[j].size()-k-1] != x[i][k]) suffix = false;
        }
        if (!suffix) continue;

        dp[i] = max(dp[i], 1 + solve(j, n, x));
    }
    return dp[i];
}

int main() {
    int n; 
    cin >> n;
    vector<string> x(n);
    dp = vector<int>(n, -1);
    for (int i = 0; i < n; ++i) cin >> x[i];

    sort(x.begin(), x.end());
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (dp[i] == -1) ans = max(ans, solve(i, n, x));
    }
    cout << ans << '\n';

    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 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