希望这次不要沉
by qbu666666 @ 2019-05-24 20:53:40
@[QWQ自动机](/space/show?uid=143834)
@[__fishsause__](/space/show?uid=185527)
@[kk刘若宽](/space/show?uid=136588)
@[封禁用户名f8617dda](/space/show?uid=37682)
by qbu666666 @ 2019-05-24 20:56:07
真的不会啊 窝最蒟辽
by Raw_Aya9285 @ 2019-05-24 20:59:29
------------
听说这个是可持久化trie
by qbu666666 @ 2019-05-24 21:02:34
@[qbu666666](/space/show?uid=157598) 你是什么问题？
by 御·Dragon @ 2019-05-24 21:11:37
可持久化trie??
~~为什么感觉又和线段树与主席树有点关系~~
by aminoas @ 2019-05-24 21:12:33
@[封禁用户名f8617dda](/space/show?uid=37682) 这个东西
```cpp
#include<cstdio>
#include<vector>
#include<string>
using namespace std;
struct trie{
vector<vector<char> >trie_tree;
void insert(string line,int now=0){
int i0,len=line.length();
while(now<len){
i0=line[now];
if(trie_tree.size()<now){
vector<char>vec;
vec.clear();
trie_tree.push_back(vec);
}
while(trie_tree[now-1].size()<now){
trie_tree[now-1].push_back((char)i0++);
}
now++;
}
}
bool count(string line,int now=0){
while(trie_tree[now].size()<now&&now<trie_tree.size()){
now++;
}
return false;
}
};
trie test;
string line="qbu666666";
int main(){
test.insert(line);
puts(test.count(line)?"Yes":"No");
return 0;
}
```
然后就RE了，并没有输出（return 3221225477）
by qbu666666 @ 2019-05-24 21:13:30
@[QwQ自动机](/space/show?uid=143834) 听一位dalao说的
by qbu666666 @ 2019-05-24 21:14:45
@[qbu666666](/space/show?uid=157598) 我想我该拜您为师
by 御·Dragon @ 2019-05-24 21:15:25
@[封禁用户名f8617dda](/space/show?uid=37682) 我是在乱写trie吗
by qbu666666 @ 2019-05-24 21:16:33