唐宋元明清201712151935887

未归档

dp(15) h(10) kmp(1) 二分(4) 匹配(1) 图论(45) 大水题~~(7) 数据结构(3) 杂乱的一坨(2) 树形结构(10) 简单搜索(6) 题解(1) 高精度(1)

/ 注册

全部文章 / 未归档（共123篇）

CodeForces - 1042C （emmmmmm水题）

You are given an array aa consisting of nn integers. You can perform the following operations with it: Choose some positions ii and jj (1≤i,j≤n,i≠j...

2018-12-02

0 644

高维前缀和~~

1.首先求某个二进制状态下所有他的超集的和是多少~ for(int i = 0; i< 3 ;++i){ for(int j = 0; j<8 ;++j) if( !(j&(1<<(i))) ) dp[j] += dp[j|(1<&...

2018-10-24

0 505

HDU - 4804 Campus Design（轮廓线dp）

Nanjing University of Science and Technology is celebrating its 60th anniversary. In order to make room for student activities, to make the university...

2018-10-23

0 573

POJ - 3254 Corn Fields

Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn f...

2018-10-06

0 398

HDU - 5877 Weak Pair （离散化+dfs+树状数组）

Weak Pair Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 5327 Accepted Submission(s): 1...

2018-10-01

0 393

徐州赛区网络赛 Ryuji doesn't want to study（树状数组）

Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i]. Unfortunately...

2018-09-09

0 423

ICPC2018南京网络赛 Magical Girl Haze（分层图+优先队列优化spfa）

There are NN cities in the country, and MMdirectional roads from uu to v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance c_ici. Haze is a Magica...

2018-09-02

0 507

HDU - 6447 YJJ's Salesman（树状数组优化的dp+离散化）

YJJ's Salesman Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1996 Accepted ...

2018-08-31

0 543

CodeForces - 767C Garland （dfs）

Once at New Year Dima had a dream in which he was presented a fairy garland. A garland is a set of lamps, some pairs of which are connected by wires. ...

2018-08-26

0 452

HDU - 6214 Smallest Minimum Cut（最小割边集的最小数量）

Consider a network G=(V,E)G=(V,E) with source ss and sink tt. An s-t cut is a partition of nodes set VV into two parts such that ss and tt belong to d...

2018-08-24

0 517