"Ordinary essay" 6.30

Half a few hours in 2015 will be gone.

Seems to be adding a second "leap second" tonight, you can sleep a second more tonight (and the egg

Since an ACM gold brother to talk about the network flow, oneself also stopped bzoj brush problem, concentrate on learning a variety of new algorithms.

So the list was sorted out so long ... These are all I will not ...

About 90 More ... Immediately feel that the road of Oi is extremely long ....

(since the use of xmind after a lot of the puzzle is too lazy to write, directly throw on the mind map)

Let's summarize this weekly hours thing.

First of all, learned 01 score planning, it seems to be the case this is SX problem?

Contains the optimal ratio spanning tree, the optimal ratio loop (Bzoj a usaco problem is involved), the maximum density sub-graph

Then the network flow is also more recent to learn the maximum weight of the closed graph, the global graph of the smallest cut, but also the upper and lower bounds of the network flow review again

Now I still think the maximum density sub-graph is the most sxbk thing ... Some problems also want to output the scheme ... Precision various pits ...

Worship Hubertau's smallest cut paper, also learned some of the characteristics of the minimum cutting problem

Now is not the same as the flower tree did not get, full of senior left a pit (brother is really too God

Tomorrow, the city exam, and Oi conflict again

After all, the province of his recent election test smashed, or can be separated from the cultural class vortex (glance

"Ordinary essay" 6.30