Others

View Code #include#includeconst int maxn = 50010;int c[maxn];int lowbit(int x){return x&-x;}void update(int x,int d){for(;x c[x]+=d;}int query(int x){int sum=0;for(;x>0;x-=lowbit(x)) sum+=c[x];return sum;}int main(){int t,n,cases=1,i,

Without a doubt, the farthest point must be on the tubao. So we can calculate the convex hull first, and then enumerate the vertices on the tub. At this time, the point will be much less than in the original situation. The convex hull uses the quick

It's really slow. When I see several hundred ms of others, I will know that this question cannot be AC, even if it's a matter of data. Remember this firstView Code #include#include#include#includeusing namespace std;const int M =1010;int

Method: First, the prime factor of n is decomposed, and each prime factor is recorded separately. Then the number of non-interconnectivity with a certain prime factor in the obtained range is n/r (I). Assume that r (I) is a qualitative factor of

It's easy to understand the meaning of a simple question. Since dp and ep are both leaf nodes and the tree is full of Binary Trees, you can directly find the recent common ancestor, and then add or subtract it.View Code # Include # Include Int

View Code #include #include #include #include #includeusing namespace std;long long prime[16]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};long long bestSum;long long bestRes;long long N;void work(long long res,long long sum,int k,long long limit){if(

View Code #include int left[250003], right[250003]; __int64 count; void merge(int a[], int l, int m, int r) { int i, j, k, n1, n2; n1 = m - l + 1; n2 = r - m; for (i = 0; i left[i] = a[l+i]; for (i = 0; i right[i] =

View Code # Include # Include # Include Using namespace std;Int main (){Int m, I, j, k;Char ch [1000], map [] = "0123456789 ABCDEFGHIJKLMNOPQRSTUVWXYZ ";Int t;Scanf ("% d", & t );While (t --){_ Int64 n = 0;Stack s;Scanf ("% d % s", & m, & k, ch )

Status transfer: Dp [state] [I] = sigma (dp [state '] [I-1]); state and state' are both legal More comments are included in the Code.View Code # Include # Include Int dp [13] [1 Int cur [15];Int state [1 Int m, n, tot;Const int mod = 100000000;Bool

Type: no source sink feasible stream Reference self () Http://hi.baidu.com/evelynhe/blog/item/f1c5ba2fcbe674271e3089ad.html The capacity of each edge satisfies certain limits, that is, there is an upper limit and a lower limit. The upper bound is

Create a graph from rows to columns and add two source sink points. The source point is connected to the row edge, and the capacity is the cost of the row. The size is the cost of the column, the position of an umbrella soldier is x, y, Then, from

Find a continuous interval, so that it is equal to or greater than k in the condition that the remainder of p is satisfied. Practice: Use the line segment tree to maintain the minimum range and the smallest subscript, that is, the leftmost. Because

Record three domains, which are passed up after each update. Sum []: The total valid range of the current node (overwritten at least twice) Cover []: Number of times the current node range is overwritten Once []: Total number of times covered in the

Posters Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 2061 Accepted Submission (s): 455Problem DescriptionTed has a new house with a huge window. in this big summer, Ted decides to decorate the

For a tree, the number of Subtrees at each node is smaller than this number. Dfs will enter a vertex once, And the vertices passing through in the middle are all the vertices in its subtree. Therefore, when it enters, it will be counted and when it

I didn't come up with it. I referred to the online practices. The maximum distance between two lights is enumerated. The answer is at least half of the distance. Enumerate each lamp, remove the lamp that does not meet the condition, that is, the

A small bug occurs for a long time. Due to the absence of discretization, the domain space of the Line Segment tree should be 4 * maxn, and maxn is the maximum value of x coordinates.View Code # Include # Include # Include Using namespace std;#

Record the dfs traversal sequence, and then use a tree array to quickly sum It's been a long time.View Code # Include # Include # Include Using namespace std;Stack ss;Const int maxn = 100010;Struct EDGE {Int v, next;} Edge [maxn * 2];Int exis

1 a: Check whether there is an empty position with a continuous length. insert it to the leftmost position. 2 a B: [a, a + b-1] interval clear Node record information: 1: maximum continuous vacancy (msum) in the interval) 2: consecutive vacancy

Q: a penguin exists on an ice cube. In total, you can jump out of B and ask if all penguins may jump to an ice cube to output all possible numbers of ice cubes. Since each vertex can only jump out m penguins, we need to split the vertex. If you do