随笔分类 -  图论

摘要：You are trying to program a robot to navigate through a 2-dimensional maze and find the exit. The maze can be represented as a grid wi... 阅读全文

摘要：Mr. Panda lives in Pandaland. There are many cities in Pandaland. Each city can be treated as a point on a 2D plane. Different cities are located in d 阅读全文

摘要：There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sigh... 阅读全文

摘要：Given a n*n matrix C ij (1<=i,j<=n),We want to find a n*n matrix X ij(1<=i,j<=n),which is 0 or 1. Besides,X ij meets the following conditions: 1.X 12+ 阅读全文

摘要：Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 d[y] + w(y, x)，我们需要更新d[x]的值，这对应了最短路... 阅读全文

摘要：This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you 阅读全文