11 2015 档案

摘要:搬砖Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4646Accepted Submission(s): 1060Problem Descript... 阅读全文
posted @ 2015-11-29 20:17 啦咯 阅读(333) 评论(0) 推荐(0) 编辑
摘要:#include#include#include#include#include#include#include#includeusing namespace std;#define N 1005int main(){ int n; long long f[N]={0,1,2,5}; ... 阅读全文
posted @ 2015-11-29 20:13 啦咯 阅读(584) 评论(0) 推荐(0) 编辑
摘要:逆袭指数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 626Accepted Submission(s): 94Problem Descripti... 阅读全文
posted @ 2015-11-29 20:00 啦咯 阅读(272) 评论(0) 推荐(0) 编辑
摘要:油菜花王国Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1609Accepted Submission(s): 411Problem Descri... 阅读全文
posted @ 2015-11-29 19:54 啦咯 阅读(201) 评论(0) 推荐(0) 编辑
摘要:http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php?cid=652&pid=1003题目大意:给你一个序列,你随便找一个区间,让这个区间的所有数都变成f(x)=(1890*x+143)%10007然后在求和 问最大的和是多少分析... 阅读全文
posted @ 2015-11-28 20:40 啦咯 阅读(196) 评论(0) 推荐(0) 编辑
摘要:http://codeforces.com/problemset/problem/544/C完全背包dp[i][j]表示第i行有j个bug#include#include#define N 550int dp[N][N], a[N];int main(){ int n, m, b, MOD; ... 阅读全文
posted @ 2015-11-27 18:17 啦咯 阅读(192) 评论(0) 推荐(0) 编辑
摘要:A. Set of Strings链接:http://codeforces.com/problemset/problem/544/A题目大意:给你一个K和一串字符,然后吧这个字符分成k份,并且每一份的开头字母都不一样#include#include#include#include#include#i... 阅读全文
posted @ 2015-11-27 18:13 啦咯 阅读(145) 评论(0) 推荐(0) 编辑
摘要:链接:http://codeforces.com/problemset/problem/540/D题目大意:这个岛上有三种生物 r石头 s剪刀 p布求最后只剩一种生物的概率用dp[i][j][k]表示概率石头和剪刀相遇的概率是p=i*j/(i*j+j*k+k*i),剪刀会被吃掉 所以dp[i][j... 阅读全文
posted @ 2015-11-20 20:52 啦咯 阅读(477) 评论(0) 推荐(0) 编辑
摘要:链接:http://codeforces.com/problemset/problem/540/CYou play a computer game. Your character stands on some level of a multilevel ice cave. In order to m... 阅读全文
posted @ 2015-11-20 19:49 啦咯 阅读(178) 评论(0) 推荐(0) 编辑
摘要:B. School Markstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vova studies programming i... 阅读全文
posted @ 2015-11-20 19:42 啦咯 阅读(166) 评论(0) 推荐(0) 编辑
摘要:Problem - 4325 http://acm.hdu.edu.cn/showproblem.php?pid=4325Problem DescriptionAs is known to all, the blooming time and duration varies between diff... 阅读全文
posted @ 2015-11-18 18:13 啦咯 阅读(144) 评论(0) 推荐(0) 编辑
摘要:Problem DescriptionJohn has several lines. The lines are covered on the X axis. Let A is a point which is covered by the most lines. John wants to kno... 阅读全文
posted @ 2015-11-18 17:51 啦咯 阅读(196) 评论(0) 推荐(0) 编辑
摘要:Problem Descriptiondxy has a collection of a series of books called "The Stories of SDOI",There aren(n≤19)books in this series.Every book has a number... 阅读全文
posted @ 2015-11-18 13:30 啦咯 阅读(125) 评论(0) 推荐(0) 编辑
摘要:DescriptionSome of Farmer John'sNcows (1 ≤N≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants t... 阅读全文
posted @ 2015-11-14 17:55 啦咯 阅读(198) 评论(0) 推荐(0) 编辑
摘要:Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segmen... 阅读全文
posted @ 2015-11-11 19:58 啦咯 阅读(152) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1698Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most o... 阅读全文
posted @ 2015-11-11 18:47 啦咯 阅读(523) 评论(0) 推荐(0) 编辑
摘要:The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all pl... 阅读全文
posted @ 2015-11-11 17:01 啦咯 阅读(193) 评论(0) 推荐(0) 编辑
摘要:DescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each ... 阅读全文
posted @ 2015-11-10 16:39 啦咯 阅读(119) 评论(0) 推荐(0) 编辑
摘要:Problem - 4635 http://acm.hdu.edu.cn/showproblem.php?pid=4635题目大意:n个点,m条边,求最多再加几条边,然后这个图不是强连通分析:这是一个单向图,如果强连通的话,他最多应该有n*(n-1)条边,假设有a个强连通块,任取其中一个强连通块,假... 阅读全文
posted @ 2015-11-03 18:05 啦咯 阅读(155) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4738题目大意:给定n个点和m条边 和每条边的价值,求桥的最小价值(最小桥)看着挺简单的但是有好多细节:1、会有重边2、如果最小价值是0的话应该输出13、m条边有可能不能连通n个点,这个时候没有花费。Caocao'... 阅读全文
posted @ 2015-11-03 13:37 啦咯 阅读(237) 评论(0) 推荐(0) 编辑
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4612题目大意:求加一条边最小的桥数先用Tarjin缩点求出一棵树,然后用bfs求出树的直径,树的直径就是加一条边桥最多的呢条边。最后就用桥减去直径就行了Warm upTime Limit: 10000/5000 ... 阅读全文
posted @ 2015-11-02 17:21 啦咯 阅读(169) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示