2019年1月21日
HDU 6005 Pandaland （寻找带权最小环）
摘要： 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 阅读全文
posted @ 2019-01-21 14:50 Minun 阅读(170) 评论(0) 推荐(0) 编辑
2019年1月20日
poj 1734 Sightseeing trip
摘要： There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sigh... 阅读全文
posted @ 2019-01-20 23:10 Minun 阅读(92) 评论(0) 推荐(0) 编辑
HDU 4370 0 or 1(思维最短路)
摘要： 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+ 阅读全文
posted @ 2019-01-20 10:54 Minun 阅读(150) 评论(0) 推荐(0) 编辑
2019年1月19日
poj 3169 Layout (差分约束)
摘要： 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]的值，这对应了最短路... 阅读全文
posted @ 2019-01-19 20:35 Minun 阅读(108) 评论(0) 推荐(0) 编辑
HDU 4725 The Shortest Path in Nya Graph
摘要： 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 阅读全文
posted @ 2019-01-19 16:55 Minun 阅读(95) 评论(0) 推荐(0) 编辑