- 博客(5)
- 资源 (6)
- 收藏
- 关注
RSS订阅原创 M. Frequent Subsets Problem - 状态压缩-2017 ACM-ICPC 亚洲区（南宁赛区）网络赛
M. Frequent Subsets Problem - 状态压缩-2017 ACM-ICPC 亚洲区（南宁赛区）网络赛The frequent subset problem is defined as follows. Suppose UUU={1, 2,…\ldots…,N} is the universe, and S1S_{1}S1,S2S_{2}S2,…\ldots…,SMS_{M}SM are MMM sets over UUU. Given a positive const
2017-09-24 16:43:49
391
原创 L. The Heaviest Non-decreasing Subsequence Problem -最长不降子序列变形nlogn-2017 ACM-ICPC 亚洲区（南宁赛区）网络赛
L. The Heaviest Non-decreasing Subsequence Problem -最长不降子序列变形nlogn-2017 ACM-ICPC 亚洲区（南宁赛区）网络赛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 rules1) If is is ne
2017-09-24 16:42:54
414
原创 HDU 6134 Battlestation Operational-莫比乌斯
HDU 6134 Battlestation Operational-莫比乌斯The Death Star, known officially as the DS-1 Orbital Battle Station, also known as the Death Star I, the First Death Star, Project Stardust internally, and simply the Ultimate Weapon in early development stages, was a
2017-09-20 23:39:20
303
原创 hdu 6124 Smallest Minimum Cut - 最少边最小割-2017 ICPC网络赛青岛站 -1009
hdu 6124 Smallest Minimum Cut - 最少边最小割2017 ICPC网络赛青岛站 -1009Consider a network G=(V,E)with source and sink t. An s-t cut is a partition of nodes set Vinto two parts such that sand tbelong to different parts. The cut set is the subset of Ewith all edges conn
2017-09-17 18:06:03
740
原创 hdu6143 Killer Names - 容斥原理
hdu6143 Killer Names - 容斥原理Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic Empire, Marek originated from the Wookiee home planet of Kashyyyk as the
2017-09-02 15:16:57
279
DOS 7.10 IOS镜像
2017-09-14
编译原理（清华大学出版社）课后题详解 第二版
2017-09-06
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人