2016年12月_NineFailure

原创 CodeForces55D

Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with

2016-12-22 17:04:10 612

原创 HDU3564 线段树+dp

Problem DescriptionThere is a sequence firstly empty. We begin to add number from 1 to N to the sequence, and every time we just add a single number to the sequence at a specific position. Now, we want

2016-12-17 00:49:53 321

原创 CodeForces 670D1&&D2

This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find th

2016-12-12 13:47:40 356

原创 HDU3549 ISAP板子题

#include <bits/stdc++.h>using namespace std;const int inf = 0x3fffffff;template <int N, int M>struct Isap{ int top; int d[N], pre[N], cur[N], gap[N]; struct Vertex { int head;

2016-12-11 21:35:54 333

原创 CodeForces 148D 概率dp

The dragon and the princess are arguing about what to do on the New Year’s Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they sho

2016-12-11 20:32:06 272

原创 CodeForces742b

There are some beautiful girls in Arpa’s land as mentioned before.Once Arpa came up with an obvious problem:Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such

2016-12-07 18:41:37 504

原创 CodeForces741b

Just to remind, girls in Arpa’s land are really nice.Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each Hos may have some fr

2016-12-07 16:59:50 550

原创 poj3177 tarjan双联通缩点

In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The co

2016-12-05 20:36:38 344

原创 poj3694 LCA+并查集+tarjan求割边

Description A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by s

2016-12-05 00:17:38 377

原创 poj1236 tarjan裸题

DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “re

2016-12-01 01:09:34 362

NineFailure的博客