摘要:
sbt:1503: [NOI2004]郁闷的出纳员 [toggle Title="code "][pascal]varl,r,a,size:Array[1..100000]of longint;le:Array[1..100000]of boolean;ans:int64;root,nn,n,m,i,k,j:longint;c,space:char;procedure lr(var x:longi... 阅读全文
摘要:
这里什么都有,除了code。。。。^_^(其实什么都没有) 阅读全文
摘要:
博客园:http://www.cnblogs.com/lbz007oi/百度空间:http://hi.baidu.com/lbz0072010/cute_loli:http://loli.byethost7.com/ 阅读全文
摘要:
求出走到每个点有的方法数a[i],再求出每个点到终点的方法数b[i]。每条边走的 次数=a[u[i]]*b[v[i]] 。可以用类spfa按照拓扑序求a[i],把入度为0的点都入栈然后a[e[j]]=a[e[j]]+a[q[h]]求b[i]可以把边反向重新spfa一遍。[toggle Title="code "][pascal]uses math;varu,v,rud,next,e,head:Ar... 阅读全文
摘要:
Welcome to WordPress. This is your first post. Edit or delete it, then start blogging! 阅读全文
摘要:
This is an example page. It's different from a blog post because it will stay in one place and will show up in your site navigation (in most themes). Most people start with an About page that introduc... 阅读全文