cstdlib

poj2181

简单dp View Code #include < iostream > #include < cstdlib
·2015-11-07 12:19

poj2155

#include <iostream> #include <cstdlib> #include <cstring> #include <cstdio>
·2015-11-07 12:18

hdu1083完备匹配的判定

hdu1083/win.cpp * Created on: 2012-8-16 * Author : ben */ #include <cstdio> #include <cstdlib
·2015-11-07 12:04

模板：abs用法

例如：#include <cstdlib>对应        #include <
·2015-11-07 12:45

TSP-旅行商问题

#include <iostream> #include <cstring> #include <cstdlib> #include <climits>
·2015-11-07 11:31

Implementation：Segment Tree 线段树

参照书上写了一个，虽然不多，但是渣渣也写的很是费力 #include <iostream> #include <cstdlib> #incl
·2015-11-07 11:30

poj 2034 Anti-prime Sequences

注意如果开始时连续数小于d时也要是合数； 用DFS暴力搜索； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:21

poj 1654 Area

求多边形的面积； View Code #include<iostream> #include<cstdio> #include<cstdlib> #
·2015-11-07 11:20

poj 1329 Circle Through Three Points

我们可以用直线相交做，也可以用向量做； 直线相交： View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:20

poj 2954 Triangle

+ 边上的点的和/2  -1; View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:18

poj 1410 Intersection

；顶点给你的顺序不一定就是左上角到右下角； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:18

poj 3304 Segments

枚举所有顶点的连线的直线与所有线段是否有交点； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:17

poj 2007 Scrambled Polygon

这个题就是求凸包； 极角排序： View Code View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:15

poj 2074 Line of Sight

这个题可以从正面做，直接用叉积求出最大值； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:15

poj 2398 Toy Storage

id=2318是一样的；这里就不解释了； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:09

poj 1556 The Doors

长度作为两点之间的距离，这样就可以转化为图论的最短路问题； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:09

poj 2318 TOYS

由于隔板已经排好序了那么我们只要从左至右暴力过去可以了，条件是叉积大于0； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:07

poj 1466 Girls and Boys

这是一道求最大独立集的问题； View Code #include<iostream> #include<cstdio> #include<cstdlib&
·2015-11-07 11:06

poj 3041 Asteroids

以列为右边建图，这样建好后，就是一个裸的二分匹配； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:03

HDU 2063 过山车

这是一道裸的二分匹配题： View Code #include<iostream> #include<cstdio> #include<cstdlib>
·2015-11-07 11:02

poj 1094 Sorting It All Out

这是一道拓扑排序题； View Code #include<iostream> #include<cstdio> #include<cstdlib>
·2015-11-07 11:01

poj 3026 Borg Maze

3：利用kruscal生成最小生成树； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:01

poj 1258 Agri-Net

一道简单的最小生成树问题： View Code #include<iostream> #include<cstdio> #include<cstdlib>
·2015-11-07 11:00

poj 2485 Highways

一道简单的最小生成树问题； View Code #include<iostream> #include<cstdio> #include<cstdlib>
·2015-11-07 11:59

poj 2240 Arbitrage

这题可以用bellman比较容易解决； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:58

poj 1125 Stockbroker Grapevine

问你以哪个节点为起点时到所有的节点的最短路的最长路最短； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:57

poj 3259 Wormholes

bellman算法； 这里要注意的是路是双向的； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:55

poj 1860 Currency Exchange

该种币种的数值数； 注意：货币的兑换可以循环使用多次； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:54

poj 2993 Emag eht htiw Em Pleh

2996的反过来求的；这个题注意的就是建图； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-07 11:53

ZOJ1029

贪心，考虑连廊的特殊性即可过了   #include <iostream> #include  <cstdlib> using 
·2015-11-07 10:45

ZOJ1025(简单贪心)

  #include <iostream> #include  <cstdlib> using namespace &
·2015-11-07 10:44

ZOJ1331

#include  < iostream > #include  < cstdlib > using   namespace  
·2015-11-07 10:39

Manacher模板

#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #
·2015-11-07 10:24

师范大学 e: skyscrapers

1 #include<iostream> 2 #include<stdio.h> 3 #include<cstring> 4 #include<cstdlib
·2015-11-07 09:01

求N的因子之和。

5 6 #include<iostream> 7 #include<map> 8 #include<cstdio> 9 #include<cstdlib
·2015-11-07 09:54

poj1010

dfs View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-06 08:10

poj2153

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:01

poj2141

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:01

poj2136

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:00

poj2112

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:58

poj2299

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:57

poj2104

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:57

poj2291

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:56

poj2262

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:55

poj2255

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:54

poj2251

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:53

poj2248

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:52

poj2249

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:52

poj2239

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:51

poj2236

< iostream > #include < cstdio > #include < cstdlib
·2015-11-06 08:50
上一页 24 25 26 27 28 29 30 31 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他