black_hole6 - 博客园

2019年5月9日

FZU - 2038 -E - Another Postman Problem (思维+递归+回溯)

摘要： Chinese Postman Problem is a very famous hard problem in graph theory. The problem is to find a shortest closed path or circuit that visits every edge 阅读全文

posted @ 2019-05-09 21:11 black_hole6 阅读(232) 评论(0) 推荐(0)

FZU - 2037 -Maximum Value Problem(规律题)

摘要： Let’s start with a very classical problem. Given an array a[1…n] of positive numbers, if the value of each element in the array is distinct, how to fi 阅读全文

posted @ 2019-05-09 18:53 black_hole6 阅读(189) 评论(0) 推荐(0)

Pets（匈牙利算法）

摘要： Are you interested in pets? There is a very famous pets shop in the center of the ACM city. There are totally m pets in the shop, numbered from 1 to m 阅读全文

posted @ 2019-05-09 12:24 black_hole6 阅读(333) 评论(0) 推荐(0)

2019年5月8日

Construct a Matrix (矩阵快速幂+构造)

摘要： There is a set of matrixes that are constructed subject to the following constraints: 1. The matrix is a S(n)×S(n) matrix; 2. S(n) is the sum of the f 阅读全文

posted @ 2019-05-08 14:45 black_hole6 阅读(436) 评论(0) 推荐(0)

绝世好题(线性dp)

摘要：给定一个长度为n的数列ai，求ai的子序列bi的最长长度，满足bi&bi-1!=0(2<=i<=len)。 Input 输入文件共2行。第一行包括一个整数n。第二行包括n个整数，第i个整数表示ai。 Output 输出文件共一行。包括一个整数，表示子序列bi的最长长度。 Sample Inpu 阅读全文

posted @ 2019-05-08 09:44 black_hole6 阅读(338) 评论(0) 推荐(0)

String painter （区间dp）

摘要： There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help 阅读全文

posted @ 2019-05-08 09:32 black_hole6 阅读(203) 评论(0) 推荐(0)

Funny Positive Sequence （思维+前缀）

摘要： There are n integers a 1,a 2,…,a n-1,a n in the sequence A, the sum of these n integers is larger than zero. There are n integers b 1,b 2,…,b n-1,b n 阅读全文

posted @ 2019-05-08 09:10 black_hole6 阅读(305) 评论(0) 推荐(0)

Left Mouse Button (bfs)

摘要： Mine sweeper is a very popular small game in Windows operating system. The object of the game is to find mines, and mark them out. You mark them by cl 阅读全文

posted @ 2019-05-08 08:59 black_hole6 阅读(464) 评论(0) 推荐(0)

2019年5月7日

Queries for Number of Palindromes（区间dp）

摘要： You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two 阅读全文

posted @ 2019-05-07 16:50 black_hole6 阅读(199) 评论(0) 推荐(0)

Dungeon Master(三维bfs)

摘要： You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. 阅读全文

posted @ 2019-05-07 09:55 black_hole6 阅读(404) 评论(0) 推荐(0)

博学善思

一起成长

公告