zju2016的博客

#includeusing namespace std;int N,M;//N为顶点，M为边，有向图typedef struct Gnode{ int index; struct Gnode*next;}Gnode;int main(){ scanf("%d %d",&N,&M); int i,j; int **area=new int*[N]; int **a

#include#include#include#include#include#include#include#include#includeusing namespace std;void select(vector& arr){ for (int i = 0; i < arr.size()-1; i++){ int min_num = INT_MAX; int

#include#include#include#include#include#include#include#include#includeusing namespace std;void insert_recur(vector& arr,int start,int end){ if (start >= end) return; insert_recur(arr,st

#include#include#include#include#include#include#include#include#includeusing namespace std;int Binary_search(vector& arr,int element){ int start = 0; int end = arr.size()-1; while (star

#include#include#include#include#include#include#include#include#includeusing namespace std;int Binary_search(vector& arr,int element,int start,int end){ if (start > end) return -1; int m

#include#include#include#include#include#include#include#include#includeusing namespace std;int Binary_search(vector& arr,int element,int start,int end){ int i = start; int j = end; int

#include#include#include#include#include#include#include#include#includeusing namespace std;void Merge(vector& arr, int start, int mid, int end){ vector left; vector right; for (int i =

#include#include#include#include#include#include#include#include#includeusing namespace std;void Merge(vector& arr, int start, int mid, int end){ vector left; vector right; for (int i =

#include#include#include#include#include#include#include#include#includeusing namespace std;int Merge_sort(vector& arr,int start,int mid,int end){ vector left(arr.begin()+start,arr.begin(

#include#include#include#include#include#include#include#include#includeusing namespace std;int Part(vector& data,int start,int end){ int pivot = data[start]; while (start < end){ while

#include#include#include#include#include#include#include#include#includeusing namespace std;vector GetMax(vector& diff,int start,int end){ vector res; if (start >= end){ res.push_back(s

#include#include#include#include#include#include#include#include#includeusing namespace std;int find_maxsum(vector& elem){ int res = INT_MIN; int sum = 0; for (int i = 0; i < elem.size()

#include#include#include#include#include#include#include#include#includeusing namespace std;string add(string a,string b){ int in = 0;//stands for carry bit int lengtha = a.size(); int l

#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int amount; cout =1) of the array:" ; cin >> amount; vector arr(amount, 0); cout

Here is the solution for the problem.As for the (e) of this problem,the process is easy to implement.We just insert the orginal element into the tableaus and then extract the minimum.When the tableaus

#includeusing namespace std;typedef struct Gnode{ int index; struct Gnode *next;}Gnode;int N,M;//N表示顶点，M表示边int main(){ scanf("%d %d",&N,&M); int i,j; bool *visited=new bool[N]; Gnode *

#includeusing namespace std;typedef struct Gnode{ int index; struct Gnode *next;}Gnode;int N,M;//N表示顶点，M表示边，有向图int main(){ scanf("%d %d",&N,&M); int **area=new int*[N]; int **area2=new int

方法一：#includeusing namespace std;int N;//N表示顶点,有向图int main(){ scanf("%d",&N); int i,j; int **area=new int*[N]; for(i=0;i<N;i++) area[i]=new int[N]; printf("Input the matrix:\n"); for(i=0;

如果仅仅是题目当中要求的求解树的直径，一次BFS就行了#include#includeusing namespace std;int N;//邻接表存储树，N为树的节点数,将树仍然存储为无向图 //假设树的根节点的序号为0typedef struct Tnode{ int index; struct Tnode *next;}Tnode;int main(

#include#include#includeusing namespace std;typedef struct Gnode{ int color;//0 white,1 gray,2 black; int index; int depth; bool visited; struct Gnode *next;}Gnode;int N,M;//无向图，N为顶点，M为边

#include#include#include#include#include#include#include#include#includeusing namespace std;vector> add(vector> A, vector> B){ int size = A.size(); vector> res(size,vector(size,0)); if (

#include#include#include#include#include#include#include#include#includeusing namespace std;typedef struct heap{ int arr_size; int heap_size; int *arr;}heap;void Tune(heap& h,int star

#include#include#include#include#include#include#include#include#includeusing namespace std;typedef struct heap{ int arr_size; int heap_size; int *arr;}heap;void Tune(heap& h,int star

#include#include#include#include#include#include#include#include#includeusing namespace std;typedef struct node{ int index; int value;}node;typedef struct heap{ int a_size; int h_siz

#include#include#include#include#include#include#include#include#includeusing namespace std;class Priority_queue{private: int h_size; vector elem;public: Priority_queue(){ elem.push

#include#include#include#include#include#include#include#include#includeusing namespace std;typedef struct{ int d_dimential; int a_size; int h_size; int *arr;}heap;void Tune(heap& h,

here are two ways:first,we could set a variable "temp" which equals zero,and we could get the element of  the array one by one.Every time we get a number,we must judge,if temp is less than or equal