- 博客(12)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 http://poj.org/problem?id=3125
Printer QueueTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3702 Accepted: 1995DescriptionThe only printer in the computer science students' union is e
2014-07-30 17:02:04
729
转载 http://poj.org/problem?id=1363
RailsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24642 Accepted: 9662DescriptionThere is a famous railway station in PopPush City. Country there is
2014-07-30 13:31:08
730
原创 http://poj.org/problem?id=3750
小孩报数问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9959 Accepted: 4635Description有N个小孩围成一圈，给他们从1开始依次编号，现指定从第W个开始报数，报到第S个时，该小孩出列，然后从下一个小孩开始报数，仍是报到S个出列
2014-07-30 09:48:23
573
原创 http://poj.org/problem?id=2413
How many Fibs?Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10543 Accepted: 3910DescriptionRecall the definition of the Fibonacci numbers: f1 := 1
2014-07-29 20:18:30
762
原创 http://poj.org/problem?id=1001
ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 134006 Accepted: 32768DescriptionProblems involving the computation of exact values of very
2014-07-29 17:59:08
772
原创 http://poj.org/problem?id=1503
Integer InquiryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29577 Accepted: 11509DescriptionOne of the first users of BIT's new supercomputer was Chi
2014-07-29 13:52:00
629
原创 http://poj.org/problem?id=3337
Expression EvaluatorTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1925 Accepted: 594DescriptionThis problem is about evaluating some C-style expressio
2014-07-29 10:33:47
601
原创 http://poj.org/problem?id=1598
Excuses, Excuses!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3658 Accepted: 1272DescriptionJudge Ito is having a problem with people subpoenaed for
2014-07-28 18:02:49
596
转载 http://blog.csdn.net/wangjian8006/article/details/7623199
题目大意：给出两个字符串，要使他们对齐，比如：AGTGATGGTTAG这两个字符串可以看成是AGTGATG-GTTA-G也可以看成是AGTGAT-G-GT--TAG然后每个对齐的字母去查表可以得到他们的值问怎么对齐可以得到所有值的和的最大值解题思路，这是一个变形的最长公共子序列。变的是最优解1.取字符i-1和j-1的时候dp[i][j]=dp[i
2014-07-27 15:24:24
612
原创 http://poj.org/problem?id=2408
#include #include #include #include using namespace std;typedef struct { char s[100]; char re_s[100];}word;word data[30005];int cnt = 0;typedef struct { int num; int start;}p
2014-07-25 19:52:50
695
原创 http://poj.org/problem?id=2192
方法一：#include #include #include using namespace std;char a[210];char b[210];char c[210];bool can[210][210];void init() { for (int i = 0; i < 210; i ++) { for (int j = 0; j < 210; j ++
2014-07-24 16:03:10
735
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人