0303——XGBoost AdaBoost GBDT+TCM

1.机器学习概念：

残差：实际值-预测值=残差

https://bigquant.com/community/t/topic/125885

#include "cstdio"
#include "cstring"
#include "iostream"
#include "queue"
#include "string"
using namespace std;
struct Trie
{
    Trie *next[26],*fail;
    int cnt;
}*root;
struct status
{
    Trie *last;
    int cnt;
    status(Trie *last,int cnt):last(last),cnt(cnt) {}
};
Trie *newnode()
{
    Trie *ret=new Trie;
    memset(ret->next,0,sizeof(ret->next));
    ret->fail=0;
    ret->cnt=0;
    return ret;
}
void init() {root=newnode();}
void Insert(string str)
{
    Trie *pos=root;
    for(int i=0;i<str.size();i++)
    {
        int c=str[i]-'a';
        if(!pos->next[c]) pos->next[c]=newnode();
        pos=pos->next[c];
    }
    pos->cnt++;
}
void getfail()
{
   queue<Trie *> Q;
   for(int c=0;c<26;c++)
   {
       if(root->next[c])
       {
           root->next[c]->fail=root;
           Q.push(root->next[c]);
       }
       else root->next[c]=root;
   }
   while(!Q.empty())
   {
       Trie *x=Q.front();Q.pop();
       for(int c=0;c<26;c++)
       {
           if(x->next[c])
           {
               x->next[c]->fail=x->fail->next[c];
               Q.push(x->next[c]);
           }
            //although not x->next[c],also make connect
           else x->next[c]=x->fail->next[c];
       }
   }
}
int find(string str)
{
    Trie *pos=root,*last;
    queue<status> Q;
    int ans=0;
    for(int i=0;i<str.size();i++)
    {
        int c=str[i]-'a';last;
        if(pos->next[c])
        {
            pos=pos->next[c];
            last=pos;
            while(last->cnt)
            {
                Q.push(status(last,last->cnt));
                ans+=last->cnt;
                last->cnt=0; //ÐÞ¸Älast->cnt
                last=last->fail;
            }
        }
    }
    while(!Q.empty()) //»Ö¸´last->cnt
    {
        status x=Q.front();Q.pop();
        x.last->cnt=x.cnt;
    }
    return ans;
}
int main()
{
    freopen("b.txt","r",stdin);
    ios::sync_with_stdio(false);
    int T,n;
    string tt;
    cin>>T;
    while(T--)
    {
        cin>>n;
        init();
        for(int i=1;i<=n;i++)
        {
            cin>>tt;
            Insert(tt);
        }
        getfail();
        cin>>tt;
        int ans=find(tt);
        printf("%d\n",ans);
    }
}

#include<bits/stdc++.h>
using namespace std;
struct Trie{
    Trie *next[26],*fail;
    int cnt;
}*root;
struct status{
    Trie *last;
    int cnt;
    status(Trie *last,int cnt):last(last),cnt(cnt){}
};
Trie* newNode()
{
    Trie *pos=new Trie;
    memset(pos->next,0,sizeof(pos->next));
    pos->fail=0;
    pos->cnt=0;
    return pos;
}
void init(){root=newNode();}

void Insert(string str)
{
    Trie *pos=root;
    for(int i=0;i<str.size();++i)
    {
        int c=str[i]-'a';
        if(!pos->next[c])
        {
            pos->next[c]=newNode();
        }
        pos=pos->next[c];
    }
    pos->cnt++;
}
void getfail()
{
    queue<Trie*> Q;
    for(int i=0;i<26;++i)
    {
        if(root->next[i])
        {
            root->next[i]->fail=root;
            Q.push(root->next[i]);
        }
        else
            root->next[i]=root;
    }
    while(!Q.empty())
    {
        Trie *q=Q.front();Q.pop();
        for(int i=0;i<26;++i)
        {
            if(q->next[i])
            {
                q->next[i]->fail=q->fail->next[i];
                //q already in.so just push next part
                Q.push(q->next[i]);
            }
            else
            {
                //also not also connect
                q->next[i]=q->fail->next[i];
            }
        }
    }
}
int find(string str)
{
    Trie *pos=root,*last;
    queue<status> Q;
    int ans=0;
    for(int i=0;i<str.size();++i)
    {
        int c=str[i]-'a';
        if(pos->next[c])
        {
            pos=pos->next[c];
            last=pos;
            while(last->cnt)
            {
                ans+=last->cnt;
                Q.push(status(last,last->cnt));
                last->cnt=0;
                last=last->fail;
            }
        }

    }
    while(!Q.empty())
    {
        status q=Q.front();Q.pop();
        q.last->cnt=q.cnt;
    }
    return ans;

}
int main()
{
    ios::sync_with_stdio(false);
    freopen("a.in","r",stdin);
    int T,n;
    cin>>T;
    string tt;
    while(T--)
    {
        cin>>n;
        //each init update root == change tree,so each round update once
        init();
        for(int i=0;i<n;++i)
        {

            cin>>tt;
            Insert(tt);
        }
        getfail();
        cin>>tt;
        int ans=find(tt);
        cout<<ans<<endl;
    }
    return 0;
}