![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
acm模板
Zero_Clear
真理总是简洁明确的
展开
-
KMP模板
#include<cstdio> const int maxn = 1e7; int next[maxn]; char p[maxn]; char s[maxn]; #include<cstring>void get_next(int ltp) { int i=1,j=0; next[0] = -1; while(i<=ltp) { if(j==-1原创 2017-11-23 08:52:22 · 138 阅读 · 0 评论 -
Dijkstra
Dijkstravoid dijkstra(int s) { vis[s]=1;dis[s]=0; for(int i=0;i<n;i++) { min = INF; for(int j=0;j<n;j++) if(!vis[j]&&min > dis[j]) min = dis[u=j]原创 2017-11-24 23:02:19 · 161 阅读 · 0 评论