码迷,mamicode.com
首页 >  
搜索关键字:con    ( 2749个结果
php连接mysql数据库
"; mysql_close($con);?>
分类:数据库   时间:2015-05-06 19:31:14    阅读次数:157
[leetcode] Number of Islands
Number of IslandsGiven a 2d grid map of'1's (land) and'0's (water), count the number of islands. An island is surrounded by water and is formed by con...
分类:其他好文   时间:2015-05-06 10:51:49    阅读次数:132
访问者模式
UML类图: 实例实现代码: abstract class Visitor { public abstract void VisitConcreteElementA(ConcreteElementA concreteElementA); public abstract void VisitConcreteElementB(Con...
分类:其他好文   时间:2015-05-05 19:49:01    阅读次数:108
【转】console.log 用法
转自http://www.cnblogs.com/ctriphire/p/4116207.html大家都有用过各种类型的浏览器,每种浏览器都有自己的特色,本人拙见,在我用过的浏览器当中,我是最喜欢Chrome的,因为它对于调试脚本及前端设计调试都有它比其它浏览器有过之而无不及的地方。可能大家对con...
分类:其他好文   时间:2015-05-05 12:16:07    阅读次数:134796
POJ 1018 离散最优化枚举
#include #include #include #include #include #include #include #include #include #include #define INF 100000000 using namespace std; struct node{ int b,p; bool operator <(const node& a)con...
分类:其他好文   时间:2015-05-05 09:00:49    阅读次数:132
Hard Work Does Not Pay Off
Hard Work Does Not Pay OffOlve MaudalAS A PROGRAMMER, YOU’LL FiND THAT working hard often does not pay off. You might fool yourself and a few colleagues into believing that you are con- tributing a lot...
分类:其他好文   时间:2015-05-04 10:05:14    阅读次数:126
HDU-1004-Let the Balloon Rise(直接new一个字符串数组compareTo!)
Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 85666    Accepted Submission(s): 32330 Problem Description Con...
分类:编程语言   时间:2015-05-03 13:25:20    阅读次数:165
hdu 4535 错排
题意:错排链接:点我百年难得一遇大水题 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 #define MOD 100000000710 con...
分类:其他好文   时间:2015-05-02 16:23:51    阅读次数:107
POJ 3808 Malfatti Circles(计算几何)
Malfatti Circles Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 250   Accepted: 125   Special Judge Description The con?guration of three circles packed i...
分类:其他好文   时间:2015-05-01 21:20:07    阅读次数:264
bnuoj 27411 堆或单调队列维护区间RMQ
很显然n方的复杂度过不了。于是考虑优化最值的查询,可以考虑用堆或者单调队列来做。堆: 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 7 const int INF = 99999999; 8 con...
分类:其他好文   时间:2015-05-01 18:42:10    阅读次数:134
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!