__小明003的博客

敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57094    Accepted Submission(s): 24084Problem DescriptionC国的死对头A国这段时间正在进行军事演习，

A Corrupt Mayor's Performance ArtTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 1673    Accepted Submission(s): 590Problem De

In the

TransformationTime Limit: 15000/8000 MS (Java/Others)    Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 3726    Accepted Submission(s): 900Problem DescriptionYuanf

Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3856    Accepted Submission(s): 1085Problem DescriptionR

Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 16466 Accepted: 8201DescriptionRailway tickets were difficult to buy around the Lunar New Yea

Prime QueryTime Limit: 1 Second      Memory Limit: 196608 KBYou are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence.Here are

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 81386 Accepted: 25137Case Time Limit: 2000MSDescriptionYou have N i

链接：http://codeforces.com/problemset/problem/689/D#include using namespace std;#define ll long longconst int maxn=2e5+10;struct tree{ int l,r; int a,b,ma,mi;}tree[3*maxn];int a[max

City HorizonTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18646 Accepted: 5145DescriptionFarmer John has taken his cows on a trip to the city! As the

Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9622    Accepted Submission(s): 2535Problem DescriptionOur p

At the ent

Problem Description

StarsTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 1350    Accepted Submission(s): 554Problem DescriptionYifenfei is a romantic gu

Cow SortingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2690    Accepted Submission(s): 875Problem DescriptionSherlock's N (1 ≤ N

Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12437    Accepted Submission(s): 6233Problem DescriptionN个气球排成一排，从左到右依

See you~Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4167    Accepted Submission(s): 1311Problem DescriptionNow I am leaving hust

Sort itTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3379    Accepted Submission(s): 2446Problem DescriptionYou want to processe a

PandaTime Limit: 10000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2800    Accepted Submission(s): 935Problem DescriptionWhen I wrote down this l

ConturbatioTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 457    Accepted Submission(s): 208Problem DescriptionThere are ma

QueueTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 497    Accepted Submission(s): 266Problem DescriptionN people numbere

The Water ProblemTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 606    Accepted Submission(s): 489Problem DescriptionIn Land

I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 52648    Accepted Submission(s): 20685Problem Description很多学校流行一种比较

链接：http://codeforces.com/problemset/problem/437/D    两个集合A,B的个数分别n,m，当着两个集合通过f(a,b)连通时f(a,b)是最小的边，题目结果为n*m*f(a,b)*2  所以可以将边从大到小排序之后，用并查集维护并计算个数#include using namespace std;#define ll long lo