能够解决谷歌代码堵塞问题集

Question

这不是一个家庭作业问题,而是我打算知道这是否是学习编程所需要的.我保持登录TopCoder不是为了实际参与,而是基本了解问题是如何解决的.但据我所知,我不明白问题是什么,以及如何将问题转化为可以解决问题的算法.刚才我正好想看一下ACM ICPC 2010 World Finals在中国举办的活动.团队得到了问题集,其中一个是这样的:

Given at most 100 points on a plan with distinct x-coordinates,
   find the shortest cycle that passes through each point exactly once, 
   goes from the leftmost point always to the right until it reaches the 
   rightmost point, then goes always to the left until it gets back to the 
   leftmost point. Additionally, two points are given such that the the path
   from left to right contains the first point, and the path from right to 
   left contains the second point. This seems to be a very simple DP: after 
   processing the last k points, and with the first path ending in point a 
   and the second path ending in point b, what is the smallest total length
   to achieve that? This is O(n^2) states, transitions in O(n). We deal 
   with the two special points by forcing the first path to contain the first 
   one, and the second path contain the second one.

现在我不知道在阅读问题集后我应该解决什么.

谷歌代码堵塞还有另外一个:

    Problem

        In a big, square room there are two point light sources: 
one is red and the other is green. There are also n circular pillars.

        Light travels in straight lines and is absorbed by walls and pillars. 
    The pillars therefore cast shadows: they do not let light through. 
    There are places in the room where no light reaches (black), where only 
    one of the two light sources reaches (red or green), and places where 
    both lights reach (yellow). Compute the total area of each of the four
     colors in the room. Do not include the area of the pillars.

        Input

            * One line containing the number of test cases, T.

        Each test case contains, in order:

            * One line containing the coordinates x, y of the red light source.
            * One line containing the coordinates x, y of the green light source.
            * One line containing the number of pillars n.
            * n lines describing the pillars. Each contains 3 numbers x, y, r. 
    The pillar is a disk with the center (x, y) and radius r.

        The room is the square described by 0 ? x, y ? 100. Pillars, room 
    walls and light sources are all disjoint, they do not overlap or touch. 

Output

For each test case, output:

Case #X:
black area
red area
green area
yellow area

是否需要计划的人应该能够解决这些类型的问题？

如果有人能帮助我解释谷歌代码堵塞问题集,我会很感激,因为我希望今年参加这个问题Code Jam,看看我是否可以做一些.

谢谢.

Answer 1

从困难问题入手是一个很大的错误.对于很多有经验的程序员来说,许多世界总决赛的问题都太难了,所以对于一个新手来说这也太难了.

正如其他人所说,从更容易的问题开始.我假设您了解编程的基础知识,并且可以用至少一种编程语言编写代码.尝试在TopCoder上的Division-2问题集以及ACM ICPC的区域/合格轮次中遇到问题.找出SPOJ,UVa和Project Euler等网站的简单问题(有在线提供的简单问题列表)并解决它们.在您解决时,还要阅读算法和计算机科学的基础知识.TopCoder是一个很好的资源,因为他们有很多教程和文章,也允许你查看其他人的解决方案.

恕我直言,成为一个更好的程序员一般需要大量的练习和学习.没有捷径.你不能假设你是某种英雄程序员,他可以跳进去解决所有问题.你必须承认还有很长的路要走,从一开始就要开始.

Answer 2

你应该从更容易的问题开始.尝试寻找地区,甚至从当地学校竞赛中获得问题.您需要具有从数据结构到算法的一般编程的大视图.掌握一种基本的编程语言,即接受答案的语言.