题目:DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 2 #incl....
分类:
其他好文 时间:
2015-07-24 22:28:11
阅读次数:
183
Description Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 #include u...
分类:
其他好文 时间:
2015-07-23 21:40:05
阅读次数:
150
Description
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains...
分类:
其他好文 时间:
2015-07-22 18:41:17
阅读次数:
168
UVA 572 DFS(floodfill) 用DFS求连通块Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uDescriptionDue to recent rains, water has pooled in ....
分类:
其他好文 时间:
2015-07-22 09:11:56
阅读次数:
123
Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ...
分类:
其他好文 时间:
2015-07-20 21:27:30
阅读次数:
96
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1]...
分类:
移动开发 时间:
2015-07-20 19:45:52
阅读次数:
175
#include #include using namespace std;const int MAXN=10000000+5;char a[MAXN];int t;char b[3]={'w','y','h'};int main(){ scanf("%d",&t); getchar(); whil...
分类:
其他好文 时间:
2015-07-19 13:09:59
阅读次数:
152
这道题的思路很难想。 问你需要的最少实验次数,这是很难求解的,而且我们知道的条件只有三个,k、n、实验次数 。
所以我们不妨改变思路,转而求最高所能确定的楼层数 。 那么用d[i][j]表示用i个球,实验j次所能确定的最高楼层数 。
那么我们假设第j次实验是在k楼,有两种可能: 1、球破了,那么状态如何转移? 用了一个球,用了一次实验机会,所以最优情况一定是从d[i-1][j-1]转移过来的...
分类:
其他好文 时间:
2015-07-19 11:53:23
阅读次数:
110
n个部下,每个部下都要完成一个任务。每个任务需B时间交代,J时间执行。不能同时给两个部下同时交代任务。输出完成所有任务的最短时间。//Uva 11792#include #include #include #include #include #include #include #include #i...
分类:
其他好文 时间:
2015-07-17 18:00:45
阅读次数:
127
【算法题:求出高低不同的砖中能存多少水】「Trapping Rain Water」Givennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much ...
分类:
移动开发 时间:
2015-07-16 19:14:33
阅读次数:
120