Puya的博客

1863: [Zjoi2006]trouble 皇帝的烦恼Time Limit: 1 Sec  Memory Limit: 64 MBSubmit: 557  Solved: 294[Submit][Status][Discuss]Description经过多年的杀戮，秦皇终于统一了中国。为了抵御外来的侵略，他准备在国土边境安置n名将军。不幸的是这n名将军羽翼渐丰，

Find a pathTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1696    Accepted Submission(s): 736Problem DescriptionFrog fell into

1120: trs滑雪时间限制: 1 Sec  内存限制: 128 MB提交: 70  解决: 27[提交][状态][讨论版]题目描述        trs喜欢滑雪。他来到了一个滑雪场，这个滑雪场是一个矩形，为了简便，我们用r行c列的矩阵来表示每块地形。为了得到更快的速度，滑行的路线必须向下倾斜。         例如样例中的那个矩形，可以从某个点滑向上下左右四个相邻的

2480: 神奇的序列时间限制: 4 Sec  内存限制: 256 MB提交: 34  解决: 16[提交][状态][讨论版]题目描述序列a如下：a[0] = A;a[1] = B;a[i] = a[pp] * a[qq]; ( i>=2，pp = 向下取整(i/k1)，qq = 向下取整(i/k2) )有Q次询问，每次询问输入pos，请输出a[pos]

Combine StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1735    Accepted Submission(s): 507Problem DescriptionGiven three

Advanced FruitsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3371    Accepted Submission(s): 1734Special JudgeProblem Description

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38245    Accepted Submission(s): 17537Problem DescriptionA sub

Problem ArrangementTime Limit: 2 Seconds      Memory Limit: 65536 KBThe 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a problem setter, Edward is going to arrange the o

279. Perfect SquaresAdd to ListDescription Submission SolutionsTotal Accepted: 66852Total Submissions: 188029Difficulty: MediumContributors: AdminGiven a positive integ

Multiplication Puzzle POJ - 1651 思路：求出每个区间的最小值，一直扩散到整个区间 设dp[l][r]表示区间[l,r]的最优解，则状态转移如下： 1、当r-l=2时，dp[l][r] = num[l]*num[l+1]*num[r]；2、当r-l>2时，对区间的最后一

Brackets POJ - 2955 #include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define ms(a

KirinrikiTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1275    Accepted Submission(s): 503Problem DescriptionWe define the dis

To My GirlfriendTime Limit: 2000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1342    Accepted Submission(s): 522Problem DescriptionDear Guo

Pick The SticksTime Limit: 15000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1884    Accepted Submission(s): 601Problem DescriptionThe story

Buy the TicketTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 11   Accepted Submission(s) : 3Font: Times New Roman | Verdana | Georgia

小兔的棋盘Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 20   Accepted Submission(s) : 9Font: Times New Roman | Verdana | GeorgiaFont

PillsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 17   Accepted Submission(s) : 10Font: Times New Roman | Verdana | GeorgiaFont

下沙的沙子有几粒？Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4502    Accepted Submission(s): 2378Problem Description2005年11月份，我们学校参加

ssworld VS DDDTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2646    Accepted Submission(s): 530Problem DescriptionOne day, sss

dp[i][j]=区间回文子序列的个数。dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1];if(str[i] == str[j]) dp[i][j] = dp[i+1][j-1] + 1;不断从内往外推，一旦存在str[i]==str[j]那么要加上dp[i+1][j-1]。#include#include

矩形嵌套时间限制：3000 ms  |  内存限制：65535 KB难度：4描述有n个矩形，每个矩形可以用a,b来描述，表示长和宽。矩形X(a,b)可以嵌套在矩形Y(c,d)中当且仅当a<c,b<d或者b<c,a<d（相当于旋转X90度）。例如（1,5）可以嵌套在（6,2）内，但不能嵌套在（3,4）中。你的任务是选出尽可能多的矩形排成一行，使得除最后一个外，每一个矩

数塔Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 41118    Accepted Submission(s): 24431Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，

Dream CityTime Limit: 1 Second      Memory Limit: 32768 KBJAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are n trees in the yard. Let's call them tree 1, tree 2

算法提高 矩阵乘法  时间限制：3.0s   内存限制：256.0MB    问题描述　　有n个矩阵，大小分别为a0*a1, a1*a2, a2*a3, ..., a[n-1]*a[n]，现要将它们依次相乘，只能使用结合率，求最少需要多少次运算。　　两个大小分别为p*q和q*r的矩阵相乘时的运算次数计为p*q*r。输入格式　　输入的第一行

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47894    Accepted Submission(s): 19983Problem DescriptionMany year

BracketsTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionWe give the following inductive definition of a “regular

CoinsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 63   Accepted Submission(s) : 27Font: Times New Roman | Verdana | GeorgiaFont

Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5497    Accepted Submission(s): 2318Problem DescriptionRecently,

Computational Geometry?Time Limit : 6000/3000ms (Java/Other)   Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 1   Accepted Submission(s) : 1Font: Times New Roman | Verdana |

BallTime Limit : 60000/20000ms (Java/Other)   Memory Limit : 62768/62768K (Java/Other)Total Submission(s) : 0   Accepted Submission(s) : 0Font: Times New Roman | Verdana | GeorgiaFont

饭卡Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 62   Accepted Submission(s) : 33Font: Times New Roman | Verdana | GeorgiaFont Si

Letter DeletionTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice FZU 1502DescriptionYou are given two words (each word consists

/******************HDU 2602******************/#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#incl

#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define rep(i,j,k)for(i=j;

算法提高 概率计算  时间限制：1.0s   内存限制：256.0MB      问题描述　　生成n个∈[a,b]的随机整数，输出它们的和为x的概率。输入格式　　一行输入四个整数依次为n，a，b，x，用空格分隔。输出格式　　输出一行包含一个小数位和为x的概率，小数点后保留四位小数样例输入2 1 3

To Miss Our Children TimeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4662    Accepted Submission(s): 1291Problem Description

TicketsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3501    Accepted Submission(s): 1767Problem DescriptionJesus, what a grea

免费馅饼Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44940    Accepted Submission(s): 15483Problem Description都说天上不会掉馅饼，但有一天gameb

最少拦截系统Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38006    Accepted Submission(s): 14925Problem Description某国为了防御敌国的导弹袭击,发展出

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35625    Accepted Submission(s): 16206Problem Descri