社畜のブログ

Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 28331 Accepted: 15416DescriptionThere is a rectangular room, covered with square tiles. Each

小孩报数问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12161 Accepted: 5572Description有N个小孩围成一圈，给他们从1开始依次编号，现指定从第W个开始报数，报到第S个时，该小孩出列，然后从下一个小孩开始报数，仍是报到S个出列，

ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10453 Accepted: 3054DescriptionA group of cows grabbed a truck and ventured on an expedition dee

Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7106 Accepted: 1943DescriptionGiven a number of distinct decimal digits, you can form o

ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10020 Accepted: 3535DescriptionWindy has a country, and he wants to build an army to prote

LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9207 Accepted: 4419DescriptionLike everyone else, cows like to stand close to their friends when que

题目链接：http://poj.org/problem?id=1088看到题目第一眼感觉--woc,好简单！再看一下时间1000ms,瞬间萎了...orz直接宽搜BFS绝对超时啊(。﹏。*)还好朋友XJW来了一波安利思路：自定义结构体，二维数组转一维，权值为坡度，记录每个权值对应的坐标，从小到大权值排序，再用DP就可以换过了。代码很清晰的表达了以上思路：/*name:Ro

题目链接：http://poj.org/problem?id=1050读完题，画了个图，然后就AC了。为了读者能很好的理解这道题，我画下图吧。对了，这道题是点图，千万别画实数图，别问我为啥~(以前有痛苦的回忆)红色为起点。其中的绿色部分算了两遍，所以要加上这个结果。sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+maz

题目链接：http://poj.org/problem?id=1837我看到题目的时候，没什么想法，我觉得对于每个钩码来说就只有要与不要(1|0)两种关系，于是我写出了以下DP关系式：dp[i][j]+=dp[i-1][j-a[k]*b[i]];然后是关于臂力=臂长*重量,其结果其中7500为这个天平的平衡点，因为任何一边的重量都小于等于这个值。于是我将平衡点初始化为1；即DP

Jungle RoadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22617 Accepted: 10537DescriptionThe Head Elder of the tropical island of Lagrishan has a

Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21728 Accepted: 10982DescriptionCurrent work in cryptography involves (among other th

Dirichlet's Theorem on Arithmetic ProgressionsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17441 Accepted: 8799DescriptionIf a and d are relatively p

Saruman's ArmyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6311 Accepted: 3229DescriptionSaruman the White must lead his army along a straight path f

Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15789 Accepted: 4465DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 57851 Accepted: 16917Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,

AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13387 Accepted: 5863DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a c

Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26483 Accepted: 13307DescriptionDue to recent rains, water has pooled in various places in Fa

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16066 Accepted: 6643DescriptionOn Planet MM-21, after their Olympic games this year, curling

Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35738 Accepted: 11586DescriptionFarmer John wants to repair a small length of the fence arou

Double QueueTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13060 Accepted: 5883DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opene

题目链接：http://poj.org/problem?id=3083在这里感谢POJ上 xiexinxinlove大大的指导，以下摘取他对这道题的分析。逆反起点求左右，脑洞真心大！佩服~orz**注意三个问题：* 1.使用DFS计算左转优先和右转优先的路径，使用BFS计算最短路径* 2.这里的DFS不需要标记，因为按照方向顺时针（或逆时针）前进时，除非无路可走才会返回，所以不