Problems # Name A Summer Camp standard input/output 1 s, 256 MB x3197 B Different is Good standard input/output 2 s, 256 MB x2870 C Recycling Bottles standard input/output 2 s, 256 MB x664 D Robin Hood standard input/output 1 s, 256
Japan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26544 Accepted: 7206 Description Japan plans to welcome the ACM ICPC World Finals and a lot of roads
POJ3185 The Water Bowls 题目大意: 奶牛有20只碗摆成一排,用鼻子顶某只碗的话,包括左右两只在内的一共三只碗会反向,现在给出碗的初始状态,问至少要用鼻子顶多少次才能使所有碗都朝上 一开始试了一下dfs,由于对dfs还是不太熟悉,先是用了一个数组b[i]来储存翻转后的状态,后来发现这个搜索的状态虽然类似背包,要么翻转,要么不翻转,但是翻转某个碗以后会对其他的也造成影响,所以这样这样做就错了,可以只用原来的数组就ok了 在上述问题解决后,又因为胡乱剪枝导致wa了几次,一开始我
转载请注明出处: http://www.cnblogs.com/fraud/ ——by fraud Vasily the Bear and Sequence Vasily the bear has got a sequence of positive integers a1, a2, ..., an. Vasily the Bear wants to write out several numbers on a piece of paper so that the beauty