- 博客(31)
- 收藏
- 关注
原创 hdu 6050 Funny Function(快速幂)
Funny Function Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1210 Accepted Submission(s): 592 Problem Description Function Fx,
2017-07-31 20:57:40 278
原创 hdu 6049 Sdjpx Is Happy(区间DP+暴力枚举)
Sdjpx Is Happy Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 416 Accepted Submission(s): 170 Problem Description Sdjpx is a
2017-07-30 18:35:59 831
原创 hiho #1545 : 小Hi和小Ho的对弈游戏(树上博弈)
#1545 : 小Hi和小Ho的对弈游戏 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 小Hi和小Ho经常一起结对编程,他们通过各种对弈游戏决定谁担任Driver谁担任Observer。 今天他们的对弈是在一棵有根树 T 上进行的。小Hi和小Ho轮流进行删除操作,其中小Hi先手。 游戏的规则是:每次删除,小H
2017-07-30 16:10:57 603 3
原创 hdu 4649 Professor Tian(期望)
Professor Tian Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 932 Accepted Submission(s): 523 Problem Description Timer took th
2017-07-29 23:49:51 311
原创 hdu 6035 莫比乌斯+容斥原理+矩阵快速幂加速
TrickGCD Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 875 Accepted Submission(s): 343 Problem Description You are given an
2017-07-29 08:13:10 308
原创 51 nod 1158 全是1的最大子矩阵(单调栈)
1158 全是1的最大子矩阵 基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 收藏 关注 给出1个M*N的矩阵M1,里面的元素只有0或1,找出M1的一个子矩阵M2,M2中的元素只有1,并且M2的面积是最大的。输出M2的面积。 Input 第1行:2个数m,n中间用空格分隔(2 <
2017-07-28 15:45:38 351
原创 hdu 6040 Hints of sd0061(nth_element)
Hints of sd0061 Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1839 Accepted Submission(s): 539 Problem Description sd0061, t
2017-07-28 10:59:25 242
原创 bibreoj #6191. 「美团 CodeM 复赛」配对游戏(DP)@
#6191. 「美团 CodeM 复赛」配对游戏 内存限制:256 MiB时间限制:1000 ms标准输入输出 题目类型:传统评测方式:文本比较 上传者: April_AA 提交提交记录统计测试数据附加文件 题目描述 有 nnn 个人排成一排,一开始全部面向前方,然后随机朝左或是朝右转。 然后我们不断审查这个队列,每次选择两个面
2017-07-28 08:57:09 538
原创 FZU Problem 2271 X(最短路)
Problem 2271 X Accept: 13 Submit: 62 Time Limit: 1500 mSec Memory Limit : 32768 KB Problem Description X is a fully prosperous country, especially known for its complicated transpor
2017-07-28 08:56:39 272
原创 hdu 6035 Colorful Tree(树形DP)
Colorful Tree Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1194 Accepted Submission(s): 477 Problem Description There is a
2017-07-26 17:35:24 311
原创 hdu 6038 Function(思维)
Function Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 501 Accepted Submission(s): 195 Problem Description You are given a p
2017-07-26 08:30:27 446
原创 hdu 6034 Balala Power!(DP)
Balala Power! Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 998 Accepted Submission(s): 165 Problem Description Talented
2017-07-25 20:29:24 543
原创 POJ - 1703 Find them, Catch them (简易版种类并查集)
The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which g
2017-07-25 10:59:49 165
原创 cf Petya and Exam(暴力)
B. Petya and Exam time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It's hard times now. Today Petya needs to
2017-07-25 09:54:35 722
原创 hdu 1325 Is It A Tree?(并查集全都是坑)
Is It A Tree? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24813 Accepted Submission(s): 5674 Problem Description A tree is a
2017-07-24 20:29:39 202
原创 LA 3695 Garbage Heap (DP)
题意:给出平面上的N个点,找一个矩形使得边界上的点最多 解:选定上下边界,枚举左右边界; left[i],i边的左边有多少被包含在上下边界上的点,on[i]i边有多少被包含在上下边界上的点(不包括上下边界),on2[i]包括上下边界; ans=left[j]-left[i]+on2[j]+on[i]; 当枚举右边界时,保留最优值on[i]-left[i], #inc
2017-07-24 18:03:12 230
原创 hiho #1539 : 数组重排3(bfs)
#1539 : 数组重排3 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 给定一个{1..N}的排列A1, A2, ... AN,每一次操作可以将相邻的两个数一起移动(保持两个数相邻且前后顺序不变)到任意位置。询问至少经过多少次操作,可以使得原序列变为1, 2, ..., N。 例如对于54321,把32一起移
2017-07-24 09:49:10 363
原创 LA 3029 City Game (DP||单调栈)
City Game http://acm.hdu.edu.cn/showproblem.php?pid=1505 Problem Description Bob is a strategy game programming specialist. In his new city building game the gaming environment is as fo
2017-07-23 20:09:42 295
原创 hiho 大礼堂地毯(strstr 查找函数)
题目1 : 大礼堂地毯 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 小Hi的学校大礼堂的地毯是由很多块N × M大小的基本地毯拼接而成的。例如由2×3的基本地毯 ABC ABD 拼接而成的大礼堂整片地毯如下: ... ABCABCABCABCAB ABDABDABDA
2017-07-23 17:35:17 482
原创 LA 2678 Meteor (区间覆盖)
UVALive - 3905 [Meteor] index UVALive - 3905 Meteor indexDescriptioninputoutputcode Description The famous Korean internet company has provided an internet-bas
2017-07-23 11:07:05 259
原创 uva 10795 A Different Task (汉诺塔升级)
I - A Different Task 汉诺塔结论,把一个柱子上的所有盘子移到另一个柱子上需要2^(n)-1步 #include #include #include #include #include #include #include #include #include using namespace std; const int N = 1100000; t
2017-07-21 22:08:06 272
原创 LA 3177 Beijing Guards (二分+贪心)
Beijing Guards Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls we
2017-07-20 19:08:42 252
原创 hdu 2818 Building Block (多个权值的并查集)
John are playing with blocks. There are N blocks (1 M X Y : Put the whole pile containing block X up to the pile containing Y. If X and Y are in the same pile, just ignore this command. C X : Co
2017-07-18 11:39:44 214
原创 hdu 3038 How Many Answers Are Wrong (带权并查集)
TT and FF are ... friends. Uh... very very good friends -________-b FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT shou
2017-07-16 22:22:55 1007
原创 poj 1182 食物链 (带权并查集升级版)
动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是"1 X Y",表示X和Y是同类。 第二种说法是"2 X Y",表示X吃Y。 此人对N个动物,用上述两种说法,一句接一句地说
2017-07-16 20:52:36 188
原创 hiho #1532 : 最美和弦(记忆化搜索思路的DP写法)
#1532 : 最美和弦 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 某个夜晚,Bob将他弹奏的钢琴曲录下来发给Jack,Jack感动之余决定用吉他为他伴奏。 我们可以用一个整数表示一个音符的音高,并可认为Bob弹奏的曲子是由3N个整数构成的一个序列。其中每个整数的取值范围是[-200, 200]。 Jack共
2017-07-16 19:22:33 601
原创 hdu 3047 (带权并查集)@
Zjnu Stadium Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3378 Accepted Submission(s): 1305 Problem Description In 12th Zhejiang
2017-07-15 18:35:05 273
原创 反素数
反素数资料 http://codeforces.com/problemset/problem/27/E E. Number With The Given Amount Of Divisors time limit per test 2 seconds memory limit per test 256 megabytes
2017-07-11 12:16:48 267
原创 AtCoder Regular Contest 075 E - Meaningful Mean(树状数组)
Meaningful Mean Time limit : 2sec / Memory limit : 256MB Score : 600 points Problem Statement You are given an integer sequence of length N, a= {a1,a2,…,aN}, and an integer K. a has
2017-07-09 17:51:42 326
原创 玲珑 1138 - 震惊,99%+的中国人都会算错的问题(容斥原理)@
1138 - 震惊,99%+的中国人都会算错的问题 Time Limit:4s Memory Limit:128MByte Submissions:305Solved:85 DESCRIPTION 众所周知zhu是一个大厨,zhu一直有自己独特的咸鱼制作技巧. tang是一个咸鱼供应商,他告诉zhu在他那里面有NN条咸鱼(标号从1到N)可以被用来制
2017-07-08 18:09:11 404
原创 玲珑 1137 - Sin your life(和差化积)@
给一个正整数nn,求下列表达式的最大值: (sin(x)+sin(y)+sin(z))[x+y+z=n][x≥1][y≥1][z≥1](sin(x)+sin(y)+sin(z))[x+y+z=n][x≥1][y≥1][z≥1] 为了降低难度,这里的x,y,zx,y,z皆为整数 sin(x)+sin(y) = 2*sin((x+y)/2)*cos((x-y)/2); sum=si
2017-07-08 17:01:21 262
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人