[POJ1068]Parencodings

[POJ1068]Parencodings试题描述Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequ
6次阅读

二维 ST POJ 2019

题目大意:给你一个n*n的矩阵,每次给你一个点(x,y),以其为左上角,宽度为b的矩阵中最小的数值和最大数值的差是多少?  一共k个询问。思路:简单的二维st。定义dp(i,j,k,L)表示以(i,j)为左上角,宽度为(2^k, 2^L)的区间内的最大(小)值。//看看会不会爆int!数组
5次阅读

[POJ3295]Tautology

[POJ3295]Tautology试题描述WFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N,
5次阅读

[POJ2586]Y2K Accounting Bug

[POJ2586]Y2K Accounting Bug试题描述Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual r
4次阅读

[POJ2109]Power of Cryptography

[POJ2109]Power of Cryptography试题描述Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among
3次阅读

[POJ1328]Radar Installation

[POJ1328]Radar Installation试题描述Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island
4次阅读

[POJ2965]The Pilots Brothers' refrigerator

[POJ2965]The Pilots Brothers' refrigerator试题描述The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a
6次阅读

[POJ1753]Flip Game

[POJ1753]Flip Game试题描述Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is
5次阅读

POJ 2253 Frogger(dijkstra)

传送门FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39453 Accepted: 12691DescriptionFreddy Frog is sitti
9次阅读

POJ 2387 Til the Cows Come Home(最短路 Dijkstra/spfa)

传送门Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 46727 Accepted: 15899DescriptionBessi
8次阅读