u013268685的专栏(有一种幸福叫AC，有一种期待叫AK)

命运Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler  (2013-05-30)Description穿过幽谷意味着离大魔王lemon已经无限接近了！

Roman and Numberstime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRoman is a young mathematician, very famo

Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23738 Accepted: 8437DescriptionWe have received an order from Pizoor Communications

开锁魔法IITime Limit: 3000 MSMemory Limit: 256000 KTotal Submit: 23(18 users)Total Accepted: 18(16 users)Rating: Special Judge: NoDescription一日，

1484: Hengheng eat noodles时间限制: 1 Sec  内存限制: 256 MB提交: 20  解决: 17[提交][状态][讨论版]题目描述As we all know,Hengheng(big cow),very look forward to meizi and he often declare that he want to find

C. Writing Codetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProgrammers working on a large project have

DescriptionFarmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e.,

E. Remembering Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have multiset of n strings of th

The Counting ProblemTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %lluSubmitStatusDescriptionGiven two integers a and b, we write the numbers

D. Bad Luck Islandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Bad Luck Island is inhabited by thre

UVA - 12063Zeros and OnesTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionBinary numbers and their pattern o

UVA - 1213Sum of Different PrimesTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionA positive integer may be ex

输入n，统计有多少个n节点的有根树。使得每个深度中所有节点的子节点数相同。可以根据节点的孩子个数dp。开始写了个记忆化,dp[n][p]表示n个节点，第一个节点有p个孩子的方案数#includeusing namespace std;typedef long long ll;const int maxn = 1000 + 5;const ll mod = 1e9 + 7;

Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10375 Accepted: 4296DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1

Dylans loves sequence  Accepts: 250  Submissions: 806 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 131072/131072 K (Java/Others)问题描述Dylans得到了N个数a[1]...a[N]。有Q个问题，每个

有高为1到n的杆子各一根排成一行,从左往右能看见l根，从右往左能看见r根，问可能的方案数。dp[i][j][k]表示i根高度不同的杆子从左往右能看见j根，从右往左能看见k根，根据高度最低的那根杆子分类。#include #include #include #include using namespace std;typedef long long ll;const in

D. Zumatime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGenos recently installed the game Zuma on his phone

ZYB's Tree  Accepts: 77  Submissions: 513 Time Limit: 3000/1500 MS (Java/Others)  Memory Limit: 131072/131072 K (Java/Others)问题描述ZYBZYB有一颗NN个节点的树,现在他希望你对于每一个点,求出离每个点距离不超过KK的点

Card CollectorTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4336Appoint description: System Crawler  (2014-10-23)Descript

Aeroplane chessTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4405Appoint description: System Crawler  (2014-10-18)Descrip

Bone CollectorTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler  (2014-04-03)DescriptionMany years ago

The TriangleTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler  (2014-04-14)Description73 88

第一次写dp，有点小激动哈哈，纪念下1302: 最大子序列时间限制: 1 Sec  内存限制: 128 MB提交: 174  解决: 41[提交][状态][讨论版]题目描述给定一个N个整数组成的序列，整数有正有负，找出两段不重叠的连续子序列，使得它们中整数的和最大。两段子序列都可以为空。输入多组输入，每组第一行为N

转成以所有银行的总资产为背包容量V。。求最大的逃跑概率。

NEED A OFFER!Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler  (2014-04-03)DescriptionSpeakless很早就想出

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 132525    Accepted Submission(s): 30717Problem DescriptionGiven a sequenc

滑雪Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler  (2014-04-20)DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪

Piggy-BankTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler  (2014-03-08)DescriptionBefore ACM can do

Stacking Boxes BackgroundSome concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Co

#include #include#include#define INF 0X7ffffffftypedef long long LL;LL dp[8000];int sum=0;int main(){ //freopen("input.txt","r",stdin); int n; while(~scanf("%d",&n)) { i

和最长公共子序列差不多的dpA - History GradingTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status Practice UVA 111Appoint description: System Crawler  (2014-03

石子合并（一）时间限制：1000 ms  |  内存限制：65535 KB难度：3描述    有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为一堆。求出总的代价最小值。输入有多组测试数据，输入到文件结束。每组测试数据第一行有一个整

立方算法:#include#include#include#include#define M 505using namespace std;typedef long long LL;LL a[M],b[M];int dp[M][M];int main(){ //freopen("in.txt","r",stdin); int T; cin>>T;

Collecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 2341 Accepted: 1126Case Time Limit: 2000MS Special JudgeDescriptionIvan is fon

Help Me EscapeTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3640Appoint description: System Crawler  (2014-10-22)Descriptio

H - LOOPSTime Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3853Appoint description: System Crawler  (2014-10-22)Description

Kids and PrizesTime Limit:250MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice SGU 495Appoint description: System Crawler  (2014-10-25)Descriptio

主页讨论版问题名次状态统计请参赛队员将NickName修改为以下格式：队员1_队员2_队员3问题 F: Sort It时间限制: 6 Sec  内存限制: 128 MB提交: 30  解决: 8[提交][状态][讨论版]题目描述You are given a permutation of length n:p1,p2,