oil

SHUOJ 241 Franklin's Trouble（简单数学题）

241       Franklin's Trouble Description Professor Franklin is consulting for an oil
·2015-10-31 10:23

Oil Deposits（石油存储）

poj 1562 题目大意：给出一个地图，‘@’表示存在石油，‘*’表示空白，求出共有多少个油田，相邻的或者是对角线相邻算同一个油田 解决：bfs或者是dfs，本题采用dfs #include <iostream> using namespace std; int m,n; const int N=105; char map[N][N]; int dx[]={1,-1
·2015-10-31 10:31

帮帮看看错在哪里了~~~~~~~~~~~~`

/delphi_20061225092214139.html adoquery3.SQL.Add('select   *   from   daa   a,oil
·2015-10-31 09:23

hdoj 1241 Oil Deposits (dfs)

Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768
·2015-10-31 09:21

UVa 572 Oil Deposits

很简单的。 #include<cstdio> #include<iostream> #include<cstdio> #include<cstring> using namespace std; char pic[105][105]
·2015-10-31 09:24

HDU 4185 Oil Skimming（二分匹配，匈牙利算法）

Oil Skimming Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768
·2015-10-31 09:16

Oil Deposits 搜索 bfs 强联通

Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits
·2015-10-30 13:46

[翻译]国家石油公司：石油的黑暗秘密（National oil companies：Oil's dark secret）

| CARACAS AND LONDON From The Economist print edition     Most of the world's oil
·2015-10-28 09:34

hdu 1241 (Oil Deposits) legendary dfs

Problem link adress:http://acm.hdu.edu.cn/showproblem.php?pid=1241 These days I have encountered some problems when I was doing the searching problems; May those problem need to use the DFS algorith
·2015-10-28 08:09

hdu 1241 Oil Deposits

#include<stdio.h> #include<string.h> char a[110][110]; int f[8][2]={{0,1},{0,-1},{-1,1},{-1,0},{-1,-1},{1,-1},{1,0},{1,1}}; int m,n; int dfs(int i,int j) { for(int k=0;k<8;k+
·2015-10-28 08:15

HDU 1241 Oil Deposits DFS(深度优先搜索) 和 BFS（广度优先搜索）

Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total
·2015-10-27 16:27

HDU 1241 Oil Deposits bfs 难度:0

http://acm.hdu.edu.cn/showproblem.php?pid=1241 对每个还未访问的点bfs,到达的点都标为一块,最后统计有多少块即可 #include <cstdio> #include <cstring> #include <queue> using namespace std; const int maxn=101;
·2015-10-27 14:46

小学生玩ACM----广搜

Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768
·2015-10-23 08:31

hdu 1241 Oil Deposits (一次dfs搞定有某有)

1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 #include<algorithm> 5 using namespace std; 6 char map[105][105]; 7 8 int dir[8][2]={0, 1, 1, 0, -1
·2015-10-23 08:02

hdu3339 In Action(Dijkstra+01背包)

已知站点的 之间的距离，每个坦克从0点出发到某一个站点，1 unit distance costs 1 unit oil！
·2015-10-23 08:02

hdoj 1241 Oil Deposits

Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768
·2015-10-21 13:38

DFS or BFS --- 连通块

Oil Deposits Time Limit:1000MS     Memory Limit:32768KB    
·2015-10-21 12:29

hdu1241 Oil Deposits

nbsp;                            Oil
·2015-10-21 11:52

pku1562 Oil Deposits 油田合并（简单深搜）

题意：N*M的图中有一些'@',从该位置往四周8个位置延伸，求共有多少块互不连通的‘@’构成的块？简单的dfs便能搞定。。。 输入： 1 1*3 5*@*@***@***@*@*1 8@@****@*5 5 ****@*@@*@*@**@@@@*@@@**@0 0  输出： 0122 代码： #include<iostream> using name
·2015-10-21 10:12

pku2386 Lake Counting 数湖（简单深搜）

同 pku1562 Oil Deposits 油田合并（简单深搜） 输入： 10 12 W........WW. .WWW.....WWW ....WW...WW. .......
·2015-10-21 10:12

UVA 572 Oil Deposits

UVA_572 这是个相对容易的搜索题目，只要依次遍历图，遇到没有访问过的“@”就开始广搜或者深搜，直到把8个方位相邻的“@”都搜完位置。 每进入一次搜索，总数就加1。 #include<stdio.h>#include<string.h>int a[110][110],vis[110][110],num;char b[110];int dx[]={-1,1,0
·2015-10-21 10:35

今日油价接口 全国省市今日油价数据实现

接口名称：今日油价接口接口平台：免费接口接口地址：http://apis.juhe.cn/cnoil/oil_city支持格式：json/xml请求方式：GET/POST请求示例：http://apis.juhe.cn
php接口开发·2015-10-13 11:00

hdu 1241 Oil Deposits(dfs)

OilDepositsTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18935AcceptedSubmission(s):10902ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblef
Grit_ICPC·2015-10-03 16:00

1241：Oil Deposits

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1241方法：dfs思路：一看题觉得搜索倒是不难，难就难在怎样判断连通图。后查阅资料，发现了一种与dfs巧妙结合的神奇方法，真是拜服啊！首先还是按照一般原则对地图进行深搜，不同的是，我们的dfs函数不返回任何值，其作用就是对原图进行修改。修改的方法是，以一个点为基准，向他周围八个方向辐射，如果这些点中有油
freedom098·2015-09-30 19:00

UVA 572 Oil Deposits

基础题目！dfs，搜索图！#include #include usingnamespacestd; chararr[105][105]; intm,n; intdir[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}}; intdfs(intx,inty) { arr[x][y]='*'; for(intk=0;k>m>>n&
MrSiz·2015-09-29 22:00

文献综述——站在巨人的肩膀上

譬如厌氧消化的油脂，用oil
Xue_·2015-09-24 19:37

hdu 4185 Oil Skimming 【最大匹配】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4185题意：求给的矩阵中最多有几个横着或竖着的两个相连的“##”裸的最大匹配数据较水。代码：#include #include #include #include #include #include #include #include #include #include #include #includ
u014427196·2015-09-22 19:00

hdu1241 Oil Deposits

从今天巩固一下搜索方面的题，从简单的做起吧http://acm.hdu.edu.cn/showproblem.php?pid=1241ProblemDescription TheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoildeposits.GeoSurvCompworkswithonelargerec
aonaigayiximasi·2015-09-15 20:00

HDU1241 Oil Deposits

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1241/*HDU1241OilDepositshttp://acm.hdu.edu.cn/showproblem.php?pid=1241二维并查集坐标转换(ij)->(i*列数+j)*/ #include #include #include #include #include #include usi
qq_26437925·2015-09-04 09:00

POJ 1562 && HDU 1241 Oil Deposits（dfs）

Description给出一个N*M的矩形区域和每个区域的状态–@有/*没有石油，（定义）如果两个有石油的区域是相邻的（水平、垂直、斜）则认为这是属于同一个油田。求这块矩形区域一共有多少油田Input多组输入，每组输入包括两个整数n，m表示矩阵区域的列数和行数（1 #include #include usingnamespacestd; #definemaxn105 charmap[maxn][m
V5ZSQ·2015-08-25 10:00

hdu1241Oil Deposits

搜索水题http://acm.hdu.edu.cn/showproblem.php?pid=1241八个方向如果有@则为同一油田，问共多少油田。#include #include #include usingnamespacestd; chars[105][105]; intm,n; intf[8][2]={-1,-1,-1,0,-1,1,0,-1,0,1,1,-1,1,0,1,1}; voidd
aonaigayiximasi·2015-08-18 12:00

DFS-HDU-1241-Oil Deposits

OilDepositsTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18633AcceptedSubmission(s):10736ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblef
Roy_Yuan·2015-08-17 19:00

Oil Deposits(dfs深搜)

ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoildeposits.GeoSurvCompworkswithonelargerectangularregionoflandatatime,andcreatesagridthatdividesthelandintonum
Scarlett_geng·2015-08-13 02:00

HDU 1241 Oil Deposits DFS

HDU1241OilDepositsProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoildeposits.GeoSurvCompworkswithonelargerectangularregionoflandatatime,andcreatesagridthatdiv
qq_21120027·2015-08-10 19:00

hdu 1241 Oil Deposits 深搜 Ac

1241hdu原链接处packagecn.hncu.start; importjava.util.Scanner; publicclassp1241{ staticintn,m; finalstaticintb[][]={//因为题目要求连起来的才算一个，所以必须要把上下左右等八个坐标表示出来 {0,-1}, {0,1}, {-1,0}, {1,0}, {-1,-1}, {-1,1}, {1,
yangxin_blog·2015-08-10 17:00

hdu1241 Oil Deposits裸的搜哦哦哦哦

rt题目#include #include usingnamespacestd; charch[105][105]; intn,m; intdir[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}}; voiddfs(intx,inty) { ch[x][y]='*'; for(inti=0;in)continue; if(n
zhou_yujia·2015-08-10 09:00

hdu 1241 Oil Deposits(经典dfs)

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1241大意：寻找一块区域中有多少的‘@’域，左右上下还有四个斜45度的相邻点都算作连起来的。SampleInput 11 * 35 *@*@* **@** *@*@* 18 @@****@* 55 ****@ *@@*@ *@**@ @@@*@ @@**@ 00  SampleOutput
theArcticOcean·2015-08-06 20:00

hdu4185Oil Skimming 二分匹配

//n*n的油田，有的有油，有的是水， //问用最多能覆盖多少个1*2的格子 //对每一个有油的格子，如果其上下左右有油，那么在这两个点建边 //然后求最大匹配 #include #include #include #include usingnamespacestd; constintmaxn=610; intid[maxn][maxn]; charmap[maxn][maxn]; vector
cq_pf·2015-08-06 17:00

杭电 1241 Oil Deposits 递归 DFS

OilDepositsTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18322    AcceptedSubmission(s):10568ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresp
qq_24678203·2015-08-06 11:00

HDU 1241:Oil Deposits【递归】

OilDepositsTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18221    AcceptedSubmission(s):10503ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresp
lin14543·2015-08-04 10:00

HDOJ 1241 Oil Deposits(dfs)

OilDepositsTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18204    AcceptedSubmission(s):10495ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresp
zwj1452267376·2015-08-03 22:00

Oil Deposits

OilDepositsTimeLimit:2000/1000ms(Java/Other)   MemoryLimit:65536/32768K(Java/Other)TotalSubmission(s):55   AcceptedSubmission(s):38ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblefor
yanghui07216·2015-08-03 21:00

Oil Deposits

TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18183    AcceptedSubmission(s):10480ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsibleford
l15738519366·2015-08-03 20:00

hdoj 1241 Oil Deposits【DFS】

OilDepositsTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):18094    AcceptedSubmission(s):10431ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresp
liu6886·2015-08-03 16:00

hdu1241（Oil Deposits）

点击打开hdu1241ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoildeposits.GeoSurvCompworkswithonelargerectangularregionoflandatatime,andcreatesagridthatdividesthe
u011479875·2015-08-02 21:00

暑假集训第三周周六赛 搜索 F - Oil Deposits 油块

F- OilDepositsTimeLimit:1000MS     MemoryLimit:32768KB     64bitIOFormat:%I64d&%I64uSubmit Status Practice HDU1241DescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoild
linyuxilu·2015-08-02 14:00

HDOJ 1241 Oil Deposits（8方位dfs）

OilDepositsTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):17828    AcceptedSubmission(s):10250ProblemDescriptionTheGeoSurvCompgeologicsurveycompanyisresp
helloiamclh·2015-07-29 10:00

HDU 1241 Oil Deposits

题目地址：点击打开链接思路：DFSAC代码：#include usingnamespacestd; intm,n; charlol[110][110]; intx[8]={-1,-1,-1,0,0,1,1,1}; inty[8]={-1,0,1,-1,1,-1,0,1}; voiddfs(inta,intb) { lol[a][b]='*'; inti,newx,newy; for(i=0;i=0
qq_25605637·2015-07-26 21:00

zoj 1562 Oil Deposits (DFS)

DescriptionTheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoildeposits.GeoSurvCompworkswithonelargerectangularregionoflandatatime,andcreatesagridthatdividesthelandintonumeroussq
h1021456873·2015-07-24 19:00

HDU - 1241 - Oil Deposits

题意：给你一个二维数组，输出有几块油田，由样例可知，八个方向只要相连，就算是一个油田，所有八个方向都要搜索到。#include #defineMAXN150 chars[MAXN][MAXN]; intmove[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{-1,1},{1,-1},{-1,-1}}; intm,n,k,ans; voiddfs(intx,in
violet_echo_0908·2015-07-22 11:00
上一页 5 6 7 8 9 10 11 12 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他