« 博客园首页

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 浏览(12)
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 浏览(73)
http://www.cnblogs.com/zhanglanyun/archive/2011/05/19/2051367.html

并查集压缩hdu2818

nt root[30010]; int num1[30010]; int num2[30010]; int find2(int x) { if(x != root[x]) { int fx = root[x]; root[x] = find2(fx);
ljbguanli 2017-06-14 浏览(5)
http://www.cnblogs.com/ljbguanli/p/7006928.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 浏览(29)
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 浏览(35)
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 浏览(5)
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 浏览(427)
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 浏览(42)
http://www.cnblogs.com/willzhang/archive/2012/07/23/2604482.html

【bzoj2938】[Poi2000]病毒

(1),end[30010],size[30010],q[30010],fail[30010],ins[30010],vis[30010],tr[30010][...char ch[30010]; 11 inline int read() 12 { 13 int x=0,f=1; char ch=getchar()
chty 2016-10-26 浏览(18)
http://www.cnblogs.com/chty/p/6000085.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 浏览(22)
http://www.cnblogs.com/HHshy/p/5734073.html

P1196 银河英雄传说

behind[30010],front[30010],f[30010]; int find(int x) { if(f[x]==x) return x; int fx=find(f[x]); front[x]+=front[f[x]]; return f[x]=fx; } void m
primes 2017-02-24 浏览(2)
http://www.cnblogs.com/dfsac/p/6819765.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 浏览(15)
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 浏览(35)
http://www.cnblogs.com/Double680/p/5370953.html

洛谷P1637 三元上升子序列

long d1[30010], d2[30010],ans1[30010],ans2[30010],dis[30010],ans; struct node {... id; }a[30010]; int n; void update(long long x, int v) { while (x <= n)
zbtrs 2017-06-25 浏览(11)
http://www.cnblogs.com/zbtrs/p/7078292.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
琳&&leen 2013-01-18 浏览(17)
http://www.cnblogs.com/wanglin2011/archive/2013/01/18/2866940.html