摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1166//View Code 1 #include <iostream> 2 #include <string> 3 using namespace std; 4 const int MAX = 50000 + 10; 5 int C[MAX]; 6 int n; 7 int LowBit(int x) 8 { 9 return (x&(-x));10 }11 void Update(int num,int k)12 {13 while(num <= n)14 {15 . 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=2063View Code 1 #include <iostream> 2 #include <vector> 3 using namespace std; 4 const int MAX = 1500 + 10; 5 vector <int> v[MAX]; 6 int link[MAX]; 7 int used[MAX]; 8 bool FindPath(int num) 9 {10 int len = v[num].size();11 int i;12 for(i=0; 阅读全文