http://acm.hdu.edu.cn/showproblem.php?pid=4638
Problem Description
There are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are f...
                            
                            
                                分类:
编程语言   时间:
2015-08-29 14:05:18   
                                阅读次数:
185
                             
                    
                        
                            
                            
                                Greedy Gift GiversA group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not ...
                            
                            
                                分类:
其他好文   时间:
2015-08-28 19:10:32   
                                阅读次数:
154
                             
                    
                        
                            
                            
                                这道题目是多校中的一道题,一直在我的书签待看中,不想看书啊不想看书,这几天都没有好好看书了,没正正经经想过题目,正好这次把它看看,先看的题解。。。我发现我对搜索还是有点兴趣的,今天晚上做做搜索。。。我之前就觉得dfs总是回加上回溯的,我还感觉dfs基本上都是两种情况,1.对点深搜,2.对边深搜
思路:
还是看的别人的思路,厚着脸皮写一下吧,这道题目最多有8个点,(8*7)/2=28条边,我们可...
                            
                            
                                分类:
其他好文   时间:
2015-08-26 18:05:13   
                                阅读次数:
182
                             
                    
                        
                            
                            
                                DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with ...
                            
                            
                                分类:
其他好文   时间:
2015-08-25 23:15:44   
                                阅读次数:
173
                             
                    
                        
                            
                            
                                事先已准备好plist文件,结构如下1.Root为Array。2.里面有十一个字典(每个字典为一个分组)3.每个分组里有friends,name,online三个属性4.friends属性里有若干字典(每个字典代表一个好友)5.每个好友字典里有4个属性,name,icon,intro和vip6.需要...
                            
                            
                                分类:
移动开发   时间:
2015-08-25 20:56:04   
                                阅读次数:
240
                             
                    
                        
                            
                            
                                N friends go to the local super market together. The probability of their buying something from themarket is p 1 ,p 2 ,p 3 ,...,p N respectively. Afte...
                            
                            
                                分类:
其他好文   时间:
2015-08-21 22:59:20   
                                阅读次数:
179
                             
                    
                        
                            
                            
                                Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array
a consisting of n
distinct integers.
Unfortunately, the size of a is too small. You want a bigger ...
                            
                            
                                分类:
其他好文   时间:
2015-08-20 21:01:57   
                                阅读次数:
278
                             
                    
                        
                            
                            
                                DescriptionYou are going from Dhaka to Chittagong by train and you came to know one of your old friends is goingfrom city Chittagong to Sylhet. You al...
                            
                            
                                分类:
其他好文   时间:
2015-08-20 12:36:52   
                                阅读次数:
161
                             
                    
                        
                            
                            
                                题意: You are going from Dhaka to Chittagong by train and you came to know one of your old friends is goingfrom city Chittagong to Sylhet. You also know...
                            
                            
                                分类:
其他好文   时间:
2015-08-19 23:15:10   
                                阅读次数:
114
                             
                    
                        
                            
                            
                                之前用dfs剪枝AC了,http://www.cnblogs.com/ediszhao/p/4741825.html,这次用bfs+priority_queue来尝试解题题意:拯救行动,天使r有多个朋友a(friends,在这里被坑了几次,没看清题意),天使被关在牢房里,等着朋友来拯救,求拯救天使的...
                            
                            
                                分类:
其他好文   时间:
2015-08-19 19:16:11   
                                阅读次数:
101