摘要：
struct trie { int tree[maxn][30],sum[maxn],flag[maxn],tot; void insert_(char *str) { int len = strlen(str); int root = 0; for (int i = 0; i using namespace std; ... 阅读全文
摘要：
A. Remove a Progression Description: You have a list of numbers from $1$ to $n$ written from left to right on the blackboard. You perform an algorithm 阅读全文
摘要：
#include typedef long long ll; using namespace std; const ll maxm=55000; const ll maxn=300; const ll inf=0x3f3f3f3f; ll n,m,d[maxn],u[maxm],d2[maxn],v[maxm],w[maxm],d1[maxn]; struct Dijkstra ... 阅读全文