#include <bits/stdc++.h>
using namespace std ;
//TRIE
struct node{
node *nxt[26];
int is = 0;
node(){
is = 0;
for(int i = 0;i<26;i++){
nxt[i] = NULL;
}
}
};
void inser(string w,node *root){
for(auto ch:w){
if(root->nxt[ch-'a']==NULL){
root->nxt[ch-'a'] = new node();
}
root=root->nxt[ch-'a'];
}
root->is++;
}
int Nnode = 0;
vector<int> adj[3000001];
int mark[3000001];
void build(node *root){
int cur = Nnode;
for(int j = 0;j<26;j++){
if(root->nxt[j]!=NULL){
Nnode++;
adj[cur].push_back(Nnode);
mark[Nnode] = root->nxt[j]->is;
build(root->nxt[j]);
}
}
}
long long dp[3000001][2];
long long calc(int node,int ch){
if(dp[node][ch]!=-1)return dp[node][ch];
long long ma = 0 , sum = 0;
for(auto j:adj[node]){
sum+=mark[j];
}
if(ch==1){
long long su = 0;
for(auto j:adj[node]){
if(mark[j]>1)su+=calc(j,1);
else if(mark[j]==1)su
}
return dp[node][ch] = su+sum;
}
long long su = 0;
for(auto j:adj[node]){
if(mark[j]>1){
su +=calc(j,1);
}
}
for(auto j:adj[node]){
if(mark[j]==1){
ma = max(ma,calc(j,0)+su);
}else{
ma = max(ma,calc(j,0)+(su-calc(j,1)));
}
}
return dp[node][ch]=ma+sum;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
node *root = new node();
while(n--){
string s;cin>>s;
reverse(s.begin(),s.end());
inser(s,root);
}
build(root);
memset(dp,-1,sizeof dp);
long long all =0;
for(int i = 0;i<=Nnode;i++){
all = max(all,calc(i,0)+mark[i]);
}
cout<<all<<endl;
return 0 ;
}
Compilation message
rima.cpp: In function 'long long int calc(int, int)':
rima.cpp:48:34: error: expected ';' before '}' token
48 | else if(mark[j]==1)su
| ^
| ;
49 | }
| ~
rima.cpp:48:32: warning: statement has no effect [-Wunused-value]
48 | else if(mark[j]==1)su
| ^~
