# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114076 | zoooma13 | Rima (COCI17_rima) | C++14 | 740 ms | 144836 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 500005
int n;
string s[MAX_N];
int root ,nn;
int tr[27][10*MAX_N];
void add(int&p ,string&s ,int i=0){
if(!p) p = ++nn;
if(i == s.size()){
tr[26][p]++;
return;
}
add(tr[s[i]-'a'][p] ,s ,i+1);
}
int max_suf = 0;
int dfs(int&p){
int all_end = 0;
vector <int> ch(26) ,en(26);
for(int c=0; c<26; c++) if(tr[c][p]){
ch[c] = dfs(tr[c][p]);
en[c] = tr[26][tr[c][p]];
all_end += en[c];
}
if(!all_end)
return 0;
int mx = 0;
for(int c=0; c<26; c++) if(en[c])
mx = max(mx ,ch[c]);
max_suf = max(max_suf ,mx+all_end);
return mx+all_end;
}
int main()
{
cin >> n;
for(int i=0; i<n; i++){
cin >> s[i];
reverse(s[i].begin() ,s[i].end());
add(root ,s[i]);
}
dfs(root);
cout << max_suf << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |