- 博客(5)
- 收藏
- 关注
RSS订阅原创 Friend-Graph（HDU 3152）
It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a good team.In a team with n members,if there are three or more members are not friends with each other or there are three
2017-09-26 13:43:34
250
原创 The Heaviest Non-decreasing Subsequence Problem（2017南宁网络赛）
Let SSS be a sequence of integers s1s_{1}s1, s2s_{2}s2, ........., sns_{n}sn Each integer is is associated with a weight by the following rules:(1) If is is negative, then its weight is 000.
2017-09-24 20:12:06
311
原创 Minimum Distance in a Star Graph（南宁网络赛）
In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph.Given an integer nnn, an n−dimensionaln-dimensionaln−dimensional star graph, also referred to as SnS_{n}
2017-09-24 19:35:55
368
原创 A Secret（HDU 6153 扩展KMP）
Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell: Suffix(S2,i) = S2[i...len].Ni is the times that Suffix(S2,i)
2017-09-21 15:27:00
326
原创 Smallest Minimum Cut（HDU 6214 dinic模板）
Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset of E with all edges connecting nodes in different parts. A minimum cut is th
2017-09-19 19:45:57
584
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人