摘要:
思维导图:http://naotu.baidu.com/viewshare.html?shareId=awvfqc97ib4s 阅读全文
摘要:
typedef struct avltreenode *avltree;typedef struct avltreenode{ int data; avltree left; avltree right; int height;};int getheight(... 阅读全文
摘要:
思维导图http://naotu.baidu.com/viewshare.html?shareId=awjwzkoq720w 阅读全文
摘要:
#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;int n... 阅读全文
摘要:
#include#include#include#includeusing namespace std;const int inf=1to]>(dist[u]+ptr->w)) { dist[ptr->to]=dist[u]+ptr... 阅读全文
摘要:
#include#include#include#includeusing namespace std;const int inf=0x3f3f3f3f;const int N=1024;struct node{ int to; int w; node *next;... 阅读全文
摘要:
floyd#include#include#include#include#include#includeusing namespace std;int n,m,edge[250][250],vis[250],dist[250];mapa;void floyd(){ int i... 阅读全文
摘要:
#include#include#include#includeusing namespace std;const int inf=1to]>(dist[u]+ptr->w)) { dist[ptr->to]=dist[u]+ptr... 阅读全文
摘要:
#include#include#include#includeusing namespace std;const __int64 inf=1e18;const __int64 N=100+5;__int64 edge[N][N],use[N],g[N],l1,l2,l3,l4,c1... 阅读全文
摘要:
#include#include#includeconst int N=305;using namespace std;int main(){ int cas=0,n,m,q,i,j,k,x,y,t,g[305][305],vis[305],inf=1t) g[x][y]=t;... 阅读全文