https://blog.youkuaiyun.com/crate_Mzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/crate_M/article/details/51276365https://blog.youkuaiyun.com/crate_M/article/details/51276365crate_MThu, 28 Apr 2016 17:37:57 +0800 #define inf 260000 using namespace std; struct node{ int dist; int cost; };node Map[505][505]; int dist[505],cost[505],n,m,s,d;int main() { scanf("%d %d %d %]]>https://blog.youkuaiyun.com/crate_M/article/details/51274964https://blog.youkuaiyun.com/crate_M/article/details/51274964crate_MThu, 28 Apr 2016 15:50:17 +0800#define MaxN 1001 #define MinH -10001int H[MaxN],size;void Create() { size = 0; H[0] = MinH; }void Insert(int X) { int i; for(i=++size;H[i/2]>X;i/=2) H[i] =]]>https://blog.youkuaiyun.com/crate_M/article/details/51274953https://blog.youkuaiyun.com/crate_M/article/details/51274953crate_MThu, 28 Apr 2016 15:48:48 +0800 using namespace std; const int maxn = 1000; int father[maxn];int findroot(int x){ if(x != father[x]){ father[x] = findroot(father[x]); } return father[x];]]>https://blog.youkuaiyun.com/crate_M/article/details/51274936https://blog.youkuaiyun.com/crate_M/article/details/51274936crate_MThu, 28 Apr 2016 15:47:17 +0800 #includeconst int maxx = 1005; int node[maxx]; int tree[maxx]; int pos = 0,n;int cmp(const void *a,const void *b){ int *pa = (int *)a; int *pb = (int *)b; r]]>https://blog.youkuaiyun.com/crate_M/article/details/51251752https://blog.youkuaiyun.com/crate_M/article/details/51251752crate_MTue, 26 Apr 2016 16:39:02 +0800 #include #include #include #includeusing namespace std;typedef struct TreeNode *BinTre]]>https://blog.youkuaiyun.com/crate_M/article/details/51248094https://blog.youkuaiyun.com/crate_M/article/details/51248094crate_MTue, 26 Apr 2016 09:54:56 +0800 #include #includeusing namespace std;int G[10005][10005]; bool Visited[10005]; int Nv,Ne;void CreateGraph() { scanf("]]>https://blog.youkuaiyun.com/crate_M/article/details/51246548https://blog.youkuaiyun.com/crate_M/article/details/51246548crate_MMon, 25 Apr 2016 23:00:29 +0800 #include #include using namespace std;#define MinLen 42.5 struct Point{ int x; int y; bool visited; }; Point O;int N,D; vector s;double Distance(Poi]]>https://blog.youkuaiyun.com/crate_M/article/details/51246531https://blog.youkuaiyun.com/crate_M/article/details/51246531crate_MMon, 25 Apr 2016 22:58:51 +0800#define N 15int G[N][N],Nv,Ne; bool Visited[N];void InitVisit() { for(int i=0;ihttps://blog.youkuaiyun.com/crate_M/article/details/51232566https://blog.youkuaiyun.com/crate_M/article/details/51232566crate_MSun, 24 Apr 2016 11:08:07 +0800 #include #include using namespace std;int list[100010]; int node[100010][2];int main() { // freopen("F:\\in1.txt","r",stdin); int str,num,r; scan]]>https://blog.youkuaiyun.com/crate_M/article/details/51160196https://blog.youkuaiyun.com/crate_M/article/details/51160196crate_MFri, 15 Apr 2016 11:20:54 +0800void swap(int a[],int i,int]]>https://blog.youkuaiyun.com/crate_M/article/details/51159936https://blog.youkuaiyun.com/crate_M/article/details/51159936crate_MFri, 15 Apr 2016 11:00:26 +0800 int ans = 0; int num[10]; int visit[10]; void Solve() { double sum = num[0] + (double)num[1] / num[2] + (double)(num[3]*100+num[4]*10+num[5])/(num[6]*100+]]>https://blog.youkuaiyun.com/crate_M/article/details/51147336https://blog.youkuaiyun.com/crate_M/article/details/51147336crate_MWed, 13 Apr 2016 22:13:38 +0800 #includestruct Node{ int root; int left; int right; };int main(){ //create the tree int n; struct Node nodes[10]; scanf("%d",&n]]>https://blog.youkuaiyun.com/crate_M/article/details/51130267https://blog.youkuaiyun.com/crate_M/article/details/51130267crate_MTue, 12 Apr 2016 09:12:36 +0800 #includetypedef struct{ int expon; double coef; }poly;poly a[15],b[15]; double ans[2008]; int k1,k2,cnt=0;void In]]>https://blog.youkuaiyun.com/crate_M/article/details/51126255https://blog.youkuaiyun.com/crate_M/article/details/51126255crate_MMon, 11 Apr 2016 22:10:13 +0800typedef struct ploynode{ int expon; double coef; }poly;int main() { int k1,k2; poly a[12],b[12],c[30]; int i,j,pos=0; scanf("%d",&k1); for(]]>https://blog.youkuaiyun.com/crate_M/article/details/51010883https://blog.youkuaiyun.com/crate_M/article/details/51010883crate_MWed, 30 Mar 2016 08:43:02 +0800https://blog.youkuaiyun.com/crate_M/article/details/51003631https://blog.youkuaiyun.com/crate_M/article/details/51003631crate_MTue, 29 Mar 2016 10:24:23 +0800https://blog.youkuaiyun.com/crate_M/article/details/50996756https://blog.youkuaiyun.com/crate_M/article/details/50996756crate_MMon, 28 Mar 2016 11:49:16 +0800https://blog.youkuaiyun.com/crate_M/article/details/50336817https://blog.youkuaiyun.com/crate_M/article/details/50336817crate_MThu, 17 Dec 2015 04:11:55 +0800 #includeusing namespace std;int main() { int a[5] = {1,5,4,2,3}; sort(a,a+5); printf("%d",a[0]); for(int i=1;i<5;i++)]]>https://blog.youkuaiyun.com/crate_M/article/details/50255969https://blog.youkuaiyun.com/crate_M/article/details/50255969crate_MThu, 10 Dec 2015 22:33:06 +0800https://blog.youkuaiyun.com/crate_M/article/details/50219287https://blog.youkuaiyun.com/crate_M/article/details/50219287crate_MTue, 08 Dec 2015 15:10:01 +0800