码迷,mamicode.com
首页 >  
搜索关键字:acm学习    ( 151个结果
ACM学习历程—ZOJ3471 Most Powerful(dp && 状态压缩 && 记忆化搜索 && 位运算)
DescriptionRecently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of th...
分类:其他好文   时间:2015-05-10 21:52:21    阅读次数:142
ACM学习历程—POJ1151 Atlantis(扫描线 && 线段树)
DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of par...
分类:其他好文   时间:2015-05-04 11:50:31    阅读次数:133
AndyQsmart ACM学习历程——ZOJ3872 Beauty of Array(递推)
DescriptionEdward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward...
分类:其他好文   时间:2015-05-02 20:44:48    阅读次数:121
ACM学习历程—ZOJ3878 Convert QWERTY to Dvorak(Hash && 模拟)
DescriptionEdward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps Lock key, so Edward n....
分类:其他好文   时间:2015-05-02 20:40:57    阅读次数:278
ACM学习历程——HDU3333 Turing Tree(线段树 && 离线操作)
Problem DescriptionAfter inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have ...
分类:其他好文   时间:2015-05-02 12:20:50    阅读次数:90
ACM学习历程——HDU2227 Find the nondecreasing subsequences(线段树 && dp)
DescriptionHow many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3, ...., sn} ? For example, we assume that S = {1, 2, 3}, an...
分类:其他好文   时间:2015-05-01 21:09:15    阅读次数:136
ACM学习历程——POJ3321 Apple Tree(搜索,线段树)
DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has ...
分类:移动开发   时间:2015-04-30 21:36:07    阅读次数:243
ACM学习历程——NOJ1113 Game I(贪心 || 线段树)
Description尼克发明了这样一个游戏:在一个坐标轴上,有一些圆,这些圆的圆心都在x轴上,现在给定一个x轴上的点,保证该点没有在这些圆内(以及圆上),尼克可以以这个点为圆心做任意大小的圆,他想知道自己做多可以与多少个给定的圆相交(相切也算,包含不算)。Input输入有多组数据 输入到文件尾每一...
分类:其他好文   时间:2015-04-28 20:23:01    阅读次数:191
ACM学习历程——HDU5202 Rikka with string(dfs,回文字符串)
Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is o...
分类:其他好文   时间:2015-04-15 23:21:56    阅读次数:282
ACM学习历程——hihoCoder挑战赛10A 01串(策略)
时间限制:7000ms单点时限:1000ms内存限制:256MB描述给定两个整数n和m,求是否存在恰好包含n个0和m个1的01串S,使得S中不存在子串"001"和"11"。如果存在符合条件的01串则输出字典序最小的S,否则输出NO。输入一行两个整数,表示n和m。(0#include #include...
分类:其他好文   时间:2015-04-15 23:16:23    阅读次数:165
151条   上一页 1 ... 10 11 12 13 14 ... 16 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!