CQU_HYX的专栏

 Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6301    Accepted Submission(s): 1803 Problem Descri

 Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u   Description A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a

 Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2393 Description The cows have purchased a yogurt factory that makes world-

A题：给你一个n*m的矩阵，问里面有多少个只含w的子矩阵 解析：第一眼，暴力的方法3方，肯定会tle的。 这么想，枚举这个子矩阵的右下角，然后ans求和就行了。 枚举每一行，维护一个递增的单调栈，并且用一个res来记录当前能增加的，以当前枚举位置为右下角的矩阵的个数。 具体见代码// // Created by Matrix on 2015-10-04 // Copyright (c)