摘要:        
Problem Description On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it's so nice, isn'...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(74)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fa...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(42)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 ...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(54)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description In the second year of the university somebody started a study on the romantic relations between the student...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(33)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal a...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(72)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excu...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(35)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description In a kindergarten, there are a lot of kids. All girls of the kids know each other and all boys also know ea...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(186)
评论(0)
推荐(0)
        
            
        
        
摘要:        
并查集、2-SAT、二分图相关内容都看完了,但只做了些并查集、二分图判定、二分图最大匹配的题,其他内容仍需多做些题来验证一下,只剩差分约束和网络流内容没看,考试周快来了,这周先尽量看吧。。 天冷了,这周一天到晚窝在宿舍,基本废了,欠下的东西太多了,今天把东西搬...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(26)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description Jimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maxi...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(29)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Problem Description 小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见...    阅读全文
posted @ 2022-09-20 23:01
老程序员111
阅读(166)
评论(0)
推荐(0)
        
 
                     
                    
                 
                    
                
 
         浙公网安备 33010602011771号
浙公网安备 33010602011771号