木子川 - 博客园

2019年9月5日

摘要：例题：FroggerPOJ - 2253 链接 https://vjudge.net/problem/POJ-2253 1. Floyd算法算法思想：用mp[i][j]来表示i到j之间的距离，先对mp数组初始化，然后根据输入录入已知的i和j之间的距离，然后三重循环，第一重用k表示i和j之外的数，第阅读全文

posted @ 2019-09-05 20:21 木子川阅读(1783) 评论(0) 推荐(0) 编辑

Frogger POJ - 2253 最短路Floyd,Dijkstra,SPFA

摘要： Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but 阅读全文

posted @ 2019-09-05 20:11 木子川阅读(337) 评论(0) 推荐(0) 编辑

Til the Cows Come Home POJ - 2387 最短路Dijksstra

摘要： Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Be 阅读全文

posted @ 2019-09-05 18:45 木子川阅读(148) 评论(0) 推荐(0) 编辑

2019年9月3日

Airport HDU - 5046 DLX,重复覆盖+剪枝

摘要： The country of jiuye composed by N cites. Each city can be viewed as a point in a two- dimensional plane with integer coordinates (x,y). The distance 阅读全文

posted @ 2019-09-03 11:16 木子川阅读(213) 评论(0) 推荐(0) 编辑

2019年8月31日

Divisibility HDU - 3335 DLX,重复覆盖+剪枝

摘要： As we know,the fzu AekdyCoin is famous of math,especially in the field of number theory.So,many people call him "the descendant of Chen Jingrun",which 阅读全文

posted @ 2019-08-31 20:40 木子川阅读(233) 评论(0) 推荐(0) 编辑

Squiggly Sudoku HDU - 4069 DLX，不重复覆盖，数独多解判断

摘要： Today we play a squiggly sudoku, The objective is to fill a 9*9 grid with digits so that each column, each row, and each of the nine Connecting-sub-gr 阅读全文

posted @ 2019-08-31 19:23 木子川阅读(377) 评论(0) 推荐(0) 编辑

Sudoku ZOJ - 3122 DLX,不重复覆盖，16*16数独

摘要： A Sudoku grid is a 16x16 grid of cells grouped in sixteen 4x4 squares, where some cells are filled with letters from A to P (the first 16 capital lett 阅读全文

posted @ 2019-08-31 10:36 木子川阅读(510) 评论(0) 推荐(0) 编辑

2019年8月30日

Sudoku POJ - 3074 DLX,不重复覆盖，9*9数独

摘要： In the game of Sudoku, you are given a large 9 × 9 grid divided into smaller 3 × 3 subgrids. For example, . 2 7 3 8 . . 1 . . 1 . . . 6 7 3 5 . . . . 阅读全文

posted @ 2019-08-30 14:36 木子川阅读(615) 评论(0) 推荐(0) 编辑

2019年8月25日

Exact cover HUST - 1017 DLX，不重复覆盖

摘要： There is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cover is a selection of rows such that every column has a 1 in exactly one of 阅读全文

posted @ 2019-08-25 15:56 木子川阅读(196) 评论(0) 推荐(0) 编辑

2019年8月21日

动态规划-删括号

摘要：题目描述给你一个合法的括号序列s1，每次你可以删除一个"()" 你可以删除0个或者多个"()" 求能否删成另一个括号序列s2 输入描述: 第一行输入一个字符串s (2 ≤ |s| ≤ 100)第二行输入一个字符串t (2 ≤ |t| ≤ 100 ) 输出描述: 如果可以输出"Possible"否则阅读全文

posted @ 2019-08-21 13:14 木子川阅读(316) 评论(0) 推荐(0) 编辑