码迷,mamicode.com
首页 >  
搜索关键字:cee    ( 929个结果
poj 1741(树的点分治)
Tree Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give ...
分类:其他好文   时间:2017-03-27 19:14:34    阅读次数:248
[Noip提高组]-Day1-T2 信息传递
算法:Tarjan 大意:给你一个n边的有n个节点的图,求图中最小环 思路:直接强连通上,这道题可以涨姿势 脑子有坑!!!差点忘了出栈,第一次打强连通,感觉自己药丸 代码: 1 #include<bits/stdc++.h> 2 #define maxn 200007 3 using namespa ...
分类:其他好文   时间:2017-03-27 00:42:05    阅读次数:198
POJ3468-A Simple Problem with Integers(区间更新 + SegmentTree || SplayTree || BinaryIndexTree)
Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to ...
分类:其他好文   时间:2017-03-26 11:08:34    阅读次数:252
929条   上一页 1 ... 77 78 79 80 81 ... 93 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!