Again Prime? No time.
Input: standard input
Output: standard output
Time Limit: 1 second
The problem statement is very easy. Given a number n you have to determine the largest power of m, not ne...
分类：
其他好文 时间：
2015-05-14 20:37:11
阅读次数：
118
题目Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of each ba...
分类：
其他好文 时间：
2015-05-13 19:52:46
阅读次数：
125
题目：Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the his...
分类：
其他好文 时间：
2015-05-13 10:09:33
阅读次数：
156
题目A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.Find the larges...
分类：
其他好文 时间：
2015-05-13 00:51:35
阅读次数：
228
1.ans=max(全为a的最大矩阵，全为b的最大矩阵，全为c的最大矩阵)
2.代码：
#include
#include
#include
using namespace std;
const int INF=1<<30;
char mat[1005][1005];
int a[1005][1005];
int b[1005][1005];
int c[1005][1005];
int L...
分类：
其他好文 时间：
2015-05-12 09:30:36
阅读次数：
134
Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histog...
分类：
其他好文 时间：
2015-05-09 01:13:01
阅读次数：
169
A map of some object is a rectangular field consisting ofnrows andncolumns. Each cell is initially occupied by the sea but you can cover some some cel...
分类：
其他好文 时间：
2015-05-08 19:52:26
阅读次数：
134
Problem Description
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figur...
分类：
其他好文 时间：
2015-05-07 22:16:16
阅读次数：
143
Problem StatementYou are a goblin miner. Your job is to mine gold.Picture yourself located in a mine. The mine can be seen as a rectangular grid of (N+1) times (M+1) cells. Rows are numbered 0 through...
分类：
其他好文 时间：
2015-05-07 16:41:22
阅读次数：
122
1.注意要把a[]定义为LL，我在这里wa了N次
2.寻找边界时，得用dp思想
AC代码：#include
#include
#define LL long long
using namespace std;
const LL INF=1<<60;
LL a[100005];//要定义为LL
int L[100005];
int R[100005];
int main()
{
in...
分类：
其他好文 时间：
2015-05-07 00:55:21
阅读次数：
108
