« 博客园首页

Vsftp设置为PASV mode(被动模式传送)

ax_port=30010 pasv_min_port=30000 防火墙配置开放: -A INPUT -m state --state NEW -m tc...t 30000:30010 -j ACCEPT -A INPUT -m state --state NEW -m tcp -p tcp --dport 20 -
moqiang02 2014-03-02 浏览(11)
http://www.cnblogs.com/moqiang02/p/4061489.html

并查集的题目

int p[30010],rank[30010],size[30010],N; int findSet(int x) { int fa; if(x=...(rank,0,30010*sizeof(rank[0])); memset(size,1,30010*sizeof(size[0])); memset(p
张兰云 2011-05-19 浏览(67)
http://www.cnblogs.com/zhanglanyun/archive/2011/05/19/2051367.html

zoj 2777 Visible Lattice Points(欧拉函数,基础)

int phi[30010],prime[30010],N=30010; bool is_prime[30010]; void get_phi() { int i, j, k; k = 0; //有些题目1的欧拉函数是1,请注意 //phi[1]=1; for(
laiba2004 2014-01-18 浏览(21)
http://www.cnblogs.com/laiba2004/p/3525409.html

UVA 10608

; int x[30010]; int k[30010]; int num[30010]; int find(int y) { int r= y; ...i =1; i<30010;i++) { if(num[i] > max) {
tk在颤抖 2014-07-27 浏览(27)
http://www.cnblogs.com/DUANZ/p/3871455.html

HDU 1257

a[1] = 30010; k = 1; while(T--) { scanf("%d",&x); for(j = 1;j <= k;j ++) { if(a[j]>
wangzhili 2014-04-30 浏览(2)
http://www.cnblogs.com/wangzhili/p/3950397.html

dijkstra + heap

}}dis[30010];priority_queue<PP> Q;int vis[30010];void dijkstra(){ while(!Q.empty()) Q.pop(); int i,j,k; PP tmp; memset(vis,0,sizeof(vis)); for(
because of you 2011-12-09 浏览(299)
http://www.cnblogs.com/wuyiqi/archive/2011/12/09/2282549.html

poj1611 The Suspects

parent[30010];int total[30010];using namespace std;int getparent(int s){ if(parent[s]==s) { return s; } return parent[s]=getparent(parent[s]
willzhang 2012-07-23 浏览(40)
http://www.cnblogs.com/willzhang/archive/2012/07/23/2604482.html

BZOJ3555 [Ctsc2014]企鹅QQ 题解

long l[30010][210],r[30010][210],a[30010]; 8 9 int main() 10 { 11 int n,m,op,i,j,sum=0; 12 scanf("%d%d%d",&n,&m,&op); 13 for (i=1;i<=n;i++) 14
hhshy 2016-08-03 浏览(11)
http://www.cnblogs.com/HHshy/p/5734073.html

(tajan缩点+SPFA求最长路) poj 3160

isstack[30010],a[30010],sum[30010],in[30010]; int top,newflag; bool vis[30010]; ...<int> e[30010],mp[30010]; stack<int> s; int n,m; int Dfs[30010],use[30010],low[3
waterfull 2015-05-25 浏览(11)
http://www.cnblogs.com/water-full/p/4527335.html

[CODEVS 1036]商务旅行

4 int g[30010][510],dis[30010],num[30010],point[30010],n,m,ans=0; 5 int fa[3001...0],que[30010][3]; 6 bool bo[30010]; 7 void buildtree(int u){ 8 for (int i
double680 2016-04-09 浏览(16)
http://www.cnblogs.com/Double680/p/5370953.html

poj 1611The Suspects(并查集)

int set[30010]; 6 int rank[30010]; 7 int num[30010]; 8 int find(int x) 9 { 10 if(x!=set[x]) 11 { 12 set[x]=find(set[x]); 13 } 14 ret
琳&amp;&amp;leen 2013-01-18 浏览(14)
http://www.cnblogs.com/wanglin2011/archive/2013/01/18/2866940.html

poj 2408 Anagram Groups 字符串处理题

har str[30010][20];class trie{public : int num,id; vector<string> ss; ...0];}tmp[30010];int cmp(node s1,node s2){ return strcmp(s1.s,s2.s)<0;}int n,nu
because of you 2012-03-31 浏览(385)
http://www.cnblogs.com/wuyiqi/archive/2012/03/31/2426797.html

poj - 1442 Black Box

4 int A[30010],u[30010]; 5 int main() 6 { 7 int m,n,i,j,t; 8 while(cin>>m>>n) 9 { 10 priority_queue <int, vector<int> > small; 11
siriuslzx 2012-07-10 浏览(24)
http://www.cnblogs.com/lzxskjo/archive/2012/07/10/2585449.html

POJ3159-Candies

nt,head[30010],n,m; void ad(int x,int y,int v) { a[cnt].next=head[x]; a[...int dis[30010],i,x; priority_queue<Dis> q; c.y=1; c.dis=0; for(i
yogurt shen 2012-08-30 浏览(36)
http://www.cnblogs.com/YogurtShen/archive/2012/08/30/2664285.html

poj1442Black Box(优先队列)

int num[30010],op[30010]; 7 int main() 8 { 9 int n,m,i,j,k,g; 10 while(cin>>m>>n) 11 { 12 priority_queue <int> q1; 13 priority_qu
_雨 2013-01-23 浏览(23)
http://www.cnblogs.com/shangyu/archive/2013/01/23/2873187.html