某一学校超市，其他各单位到其的距离不同，同时各单位人员去超市的频度也不同，通过确定学校的超市要建在什么地方，才能使得方案达到最优来比较贪心算法和动态规划算法。(A school supermarket and other units to the distance, at the same time, the frequency of each unit personnel go to the supermarket, by determining the school supermarket will be built where, ability to achieve the optimal solution to compare greedy algorithm and dynamic programming algorithm.)