未完成的题目
文章平均质量分 73
ccyy-
这个作者很懒,什么都没留下…
展开
-
zoj 3784 String of Infinity(难题,方法妙)
Given a set of banned words S, please find out whether it is possible to construct a string str1..∞ with infinite length that fulfills the following constrains:It consists of only the first M type原创 2015-04-16 20:31:31 · 850 阅读 · 0 评论 -
【百度之星复赛】最强密码
由于近来密码库被盗的现象层出不穷,度度熊决定为自己的账号找一个最强密码。在研究了密码库很久之后,它总结出了一个规律:密码库中的所有密码都是一个“密码生成串”的子序列(某个序列的子序列是从最初序列通过去除某些元素但不破坏余下元素的相对位置(在前或在后)而形成的新序列)。经过强大的计算集群夜以继日的工作,度度熊得到了这个“密码生成串”。现在它希望找到一个“最强密码”,不是这个“密码生成串”的子序列原创 2015-06-07 12:02:31 · 795 阅读 · 0 评论 -
给定初速度 判断球能否到达某个点
时隔很久再回去做这道,当时自以为思路很清晰现在再回来做一遍还是会发现很多错误/混乱的地方。也许这和所谓的心态真有关系,当时想用求角平分线的方法判断是不是,但是对一种多余的情况一直很疑惑,又加上测了那个情况的样例的确错了,让我很慌。。。其实那是最接近牌的一场了╮(╯▽╰)╭据说并不需要考虑直线平行于y轴的情况,但以我的做法应该避免不了要判断的。想法也没什么错,多余的情况其实很好判断(只要看两个点原创 2016-01-26 20:27:04 · 503 阅读 · 0 评论 -
zoj 3331 Process the Tasks(双塔DP)
There are two machines A and B. There are n tasks, namely task 1, task 2, ..., task n. You must assign each task to one machine to process it. There are some facts you must know and comply with:Yo原创 2015-04-16 15:40:38 · 726 阅读 · 0 评论 -
hdu5093
待完善。。。。。。。。。。。。。http://www.cnblogs.com/baby-mouse/p/4654886.htmlhttp://www.cnblogs.com/fish7/p/4089196.htmlhttp://blog.csdn.net/u012596172/article/details/40822543http://blog.csdn.net/hpuh转载 2015-11-11 19:40:23 · 362 阅读 · 0 评论 -
【Jan.Challenge】持续时刻变化的线段树(某时刻领先选手的位置)
两种方法:[线段树+二分] / [ 队列]原创 2016-01-14 21:04:59 · 478 阅读 · 1 评论 -
hdu4803
#include #include #define eps 1e-5using namespace std;double x,y;int ans,n;int main(){ while (scanf("%lf%lf",&x,&y)!=EOF) { ans=(int)(x-1); y-=x-1+eps; if (y<0原创 2015-11-14 20:40:43 · 645 阅读 · 2 评论 -
JAG2015 ICPC Teams
You are a coach of the International Collegiate Programming Contest (ICPC) club in your university.There are 3N students in the ICPC club and you want to make N teams for the next ICPC. All teams in原创 2015-09-29 22:03:57 · 587 阅读 · 0 评论 -
【codechef】Common Strings(后缀数组)
You are given two strings A and B. Find the number of distinct strings which appear in both A and B . A string s is said to appear in S iff s is a substring (appears contiguously) of S.Input原创 2015-09-03 18:38:11 · 472 阅读 · 0 评论 -
CF 549D. Haar Features(神奇,不知道怎么推出来的)
The first algorithm for detecting a face on the image working in realtime was developed by Paul Viola and Michael Jones in 2001. A part of the algorithm is a procedure that computes Haar features. A原创 2015-06-09 18:55:25 · 885 阅读 · 0 评论 -
【codechef】Lazy Players
Concerned with the fitness levels of the players in the National Team, the coach decides to carry out a running drill in the next training session. So, he sets up checkpoints in the training ground at原创 2015-04-30 22:03:59 · 446 阅读 · 0 评论 -
spoj 694 求一个字符串中不同子串的个数
SPOJ Problem Set (classical)694. Distinct SubstringsProblem code: DISUBSTRGiven a string, we need to find the total number of its distinct substrings.InputT- number of test转载 2015-06-17 23:42:11 · 925 阅读 · 0 评论