AndyQsmart - 博客园

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... 阅读全文

posted @ 2015-05-02 20:20 AndyQsmart 阅读(218) 评论(0) 推荐(0)

AndyQsmart ACM学习历程——ZOJ3870 Team Formation（位运算）

摘要： DescriptionFor an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his universi... 阅读全文

posted @ 2015-05-02 20:04 AndyQsmart 阅读(261) 评论(0) 推荐(0)

ACM学习历程——HDU3333 Turing Tree（线段树 && 离线操作）

摘要： Problem DescriptionAfter inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have ... 阅读全文

posted @ 2015-05-02 11:27 AndyQsmart 阅读(476) 评论(0) 推荐(0)

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... 阅读全文

posted @ 2015-05-01 19:50 AndyQsmart 阅读(200) 评论(0) 推荐(0)

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 ... 阅读全文

posted @ 2015-04-30 19:33 AndyQsmart 阅读(212) 评论(0) 推荐(0)

ACM学习历程——NOJ1113 Game I（贪心 || 线段树）

摘要： Description尼克发明了这样一个游戏：在一个坐标轴上，有一些圆，这些圆的圆心都在x轴上，现在给定一个x轴上的点，保证该点没有在这些圆内(以及圆上)，尼克可以以这个点为圆心做任意大小的圆，他想知道自己做多可以与多少个给定的圆相交(相切也算,包含不算)。Input输入有多组数据输入到文件尾每一... 阅读全文

posted @ 2015-04-28 17:47 AndyQsmart 阅读(194) 评论(0) 推荐(0)

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... 阅读全文

posted @ 2015-04-15 22:14 AndyQsmart 阅读(233) 评论(0) 推荐(0)

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... 阅读全文

posted @ 2015-04-15 22:07 AndyQsmart 阅读(247) 评论(0) 推荐(0)

ACM学习历程——POJ3468 A Simple Problem with Integers（线段树）

摘要： DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to ... 阅读全文

posted @ 2015-04-15 21:54 AndyQsmart 阅读(172) 评论(0) 推荐(0)

ACM学习历程——POJ1260 Pearls（动态规划）

摘要： Description In Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pear... 阅读全文

posted @ 2015-03-29 21:41 AndyQsmart 阅读(247) 评论(0) 推荐(0)