2019年8月30日
Layout POJ - 3169(差分约束+最短路)
摘要： Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a st 阅读全文
posted @ 2019-08-30 22:13 滚烫的青春 阅读(175) 评论(0) 推荐(0)
0 or 1 HDU - 4370 (思维+最短路)
摘要： 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-08-30 20:45 滚烫的青春 阅读(244) 评论(0) 推荐(0)