#include <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
const int N = 5e5 + 10;
int n, f[N];
string s[N];
int main() {
fast_io;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i];
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j) {
int l1 = int(s[i].size()) - 1, l2 = int(s[j].size()) - 1, k = 0;
while (l1 >= 0 && l2 >= 0) {
if (s[i][l1] != s[j][l2])
break;
--l1, --l2;
++k;
}
if (k >= max(int(s[i].size()), int(s[j].size())) - 1)
f[j] = max(f[j], f[i] + 1);
}
int ans = 0;
for (int i = 0; i < n; ++i)
ans = max(ans, f[i] + 1);
cout << ans << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
14 ms |
16000 KB |
Output isn't correct |
2 |
Correct |
14 ms |
16000 KB |
Output is correct |
3 |
Incorrect |
14 ms |
16000 KB |
Output isn't correct |
4 |
Execution timed out |
1097 ms |
18016 KB |
Time limit exceeded |
5 |
Execution timed out |
1083 ms |
18944 KB |
Time limit exceeded |
6 |
Incorrect |
224 ms |
16784 KB |
Output isn't correct |
7 |
Incorrect |
123 ms |
16548 KB |
Output isn't correct |
8 |
Incorrect |
65 ms |
16496 KB |
Output isn't correct |
9 |
Execution timed out |
1098 ms |
19292 KB |
Time limit exceeded |
10 |
Incorrect |
87 ms |
16580 KB |
Output isn't correct |