POJ
童话ing
放弃不难,但坚持一定很酷。
展开
-
POJ3356(dp最短编辑距离问题)
题目链接:AGTC Language: AGTC Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15424 Accepted: 5799 Description Let x and y be two strings over some finite alphabet A. We would like to transfor...原创 2020-04-09 13:57:15 · 192 阅读 · 0 评论 -
POJ2823(线段树求区间最值)
An array of size n ≤ 10 6 is given to you. There is a sliding window of size kwhich is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each ti原创 2017-03-13 15:54:23 · 386 阅读 · 0 评论 -
poj3070(矩阵快速幂)
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, … An alterna原创 2017-03-16 16:08:23 · 255 阅读 · 0 评论 -
poj3984(bfs迷宫问题)
Language: Default 迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19778 Accepted: 11599 Description 定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0原创 2017-03-11 16:36:34 · 391 阅读 · 0 评论 -
POJ1651 区间dp
Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9879 Accepted: 6107 Description The multiplication puzzle is played with a row of car原创 2017-04-15 14:55:28 · 253 阅读 · 0 评论