cmath

立体视觉算法--SAD+DP

lt;cstring> #include <iostream> #include<cv.h> #include<highgui.h> #include <cmath
·2015-11-12 23:49

Codeforces Round #192 (Div. 2)

题意：O(-1) 思路：O（-1） 1 #include <iostream> 2 #include <cstdio> 3 #include <cmath
·2015-11-12 23:34

Poj 2777 Count Color（线段树基础）

此外莫名其妙的TLE   #include <iostream> #include <algorithm> #include <cmath>
·2015-11-12 23:31

poj-3899-The Lucky Numbers 模拟+数学

  #include<iostream> #include<cmath> #include<cstdio> #incl
·2015-11-12 23:25

POJ 3684 Physics Experiment

所以，完全可以忽略球的碰撞，就当它去穿过处理就可以了 #include <iostream> #include <cmath> #include <algorithm
·2015-11-12 23:13

POJ 2991 Crane

id=2991 《挑战程序设计竞赛》 人民邮电出版社 #include <iostream> #include <cmath> #include <cstdio>
·2015-11-12 23:12

poj 3368 Frequent values

id=3368 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #
·2015-11-12 23:29

poj 3308 Paratroopers

#include <cstring> 3 #include <algorithm> 4 #include <queue> 5 #include <cmath
·2015-11-12 23:27

poj 3422 Kaka's Matrix Travels

1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 #include<cmath
·2015-11-12 23:20

poj 2195Going Home

id=2195 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4
·2015-11-12 23:13

poj Candies

2 #include<queue> 3 #include<cstring> 4 #include<algorithm> 5 #include<cmath
·2015-11-12 23:09

poj A Round Peg in a Ground Hole

id=1584 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4
·2015-11-12 23:08

poj 1113Wall

1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4 #include<cmath
·2015-11-12 23:07

poj Building a Space Station

id=2031 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:06

poj Fishnet

id=1408 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4
·2015-11-12 23:05

poj Cash Machine

id=1276 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:04

Expanding Rods

id=1 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:03

poj Monthly Expense

id=3273 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:02

poj 2031Building a Space Station

id=2031 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:01

poj Pie

id=3122 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #define
·2015-11-12 23:01

Curling 2.0

id=3009 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:58

Dungeon Master

1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include<cstdlib
·2015-11-12 23:56

Gold Balanced Lineup

1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include <
·2015-11-12 23:55

Common Subsequence

1 #include<cstdio> 2 #include<iostream> 3 #include<cmath> 4 #include<string
·2015-11-12 23:49

Stockbroker Grapevine

id=1125 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:47

Frogger

id=2253 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #include
·2015-11-12 23:45

HDU 1711 Number Sequence KMP

  #include <iostream> #include <cstdio> #include <cstdlib> #include <cmath
·2015-11-12 23:43

SPOJ Lexicographical Substring Search 后缀自动机

disable:4996) #include<cstring> #include<string> #include<iostream> #include<cmath
·2015-11-12 22:50

SPOJ LCS2 后缀自动机

disable:4996) #include<cstring> #include<string> #include<iostream> #include<cmath
·2015-11-12 22:49

SPOJ LCS 后缀自动机

disable:4996) #include<cstring> #include<string> #include<iostream> #include<cmath
·2015-11-12 22:48

读TAOCP的算法形式化定义以及归纳法的一点感受

虽然TAOCP看的章节不多，但是有了前面CMath的学习经验，在学习的时候有些自己的体会,与大家分享一下: 关于算法的形式化定义部分讲到了定义的四元组，在这一节的习题第9题，说的是如何用一个计算方法模拟另外一个计算方法
·2015-11-12 22:08

用C语言写一个程序，得出当前系统的整形数字长（16位，32位，64位）等，不能使用sizeof()

#include <iostream>#include <cmath>using namespace std; int main(){ int num = -1; unsigned
·2015-11-12 21:14

[置顶] HDU 1754 线段树

string> #include<cstring> #include<algorithm> #include<cstdio> #include<cmath
·2015-11-12 21:10

几何模板总结——算法竞赛入门经典（第二版）

2 #include <string> 3 #include <cstdio> 4 #include <cstring> 5 #include <cmath
·2015-11-12 21:46

hdu 3045 斜率优化DP

iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath
·2015-11-12 21:09

hdu 4096 判断路径

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include
·2015-11-12 21:08

UVALive 6322 最大匹配

iostream> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath
·2015-11-12 21:07

hdu 3874 树状数组

#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #
·2015-11-12 21:06

uvalive 6323 状态压缩DP

#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #
·2015-11-12 21:06

hdu 3721 树的直径

iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<cmath
·2015-11-12 21:05

组队练习 2011年福州全国邀请赛

#include <string.h> #include <algorithm> #include <stdio.h> #include <cmath>
·2015-11-12 21:03

POJ_1365_Prime_Land

//懒得解释 #include <iostream> #include <cstring> #include <cmath> #include <cstdio
·2015-11-12 21:28

2013 ACM/ICPC Asia Regional Changsha Online - E

#include<cstring> 4 #include<algorithm> 5 #include<stdlib.h> 6 #include<cmath
·2015-11-12 21:34

1396 - Most Distant Point from the Sea

的点 求岛上某点离海最远的距离 解法： 不断的收缩多边形（求半平面交） 直到无限小 二分收缩的距离即可 如图     //大白p263 #include <cmath
·2015-11-12 21:42

poj2015

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-12 21:50

poj1320

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-12 21:49

poj2472

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-12 21:43

poj2603

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-12 21:38

poj2101

<iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath
·2015-11-12 21:35

数据结构练习（32）n个骰子的点数

#include <iostream> #include <cmath> using namespace std; const int MAX_VALUE = 6;
·2015-11-12 20:01
上一页 12 13 14 15 16 17 18 19 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他