终有绿洲摇曳在沙漠

1.题目描述：B. Dasha and friendstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRunning with barriers on

1.题目描述：A. Carrot Cakestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn some game by Playrix it take

1.题目描述：B. Kefa and Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa wants to celebrate hi

1.题目描述：D. Array Divisiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has an array a consist

1.题目描述：B. Sagheer, the Hausmeistertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSome people leave t

1.题目描述：B. The Golden Agetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUnlucky year in Berland is su

C. Jury Marks 题目链接 分类：暴力、二分1.题意概述某人昨晚看一场比赛选手比完以后有kk位评委依次（根据时间轴顺序）打分为a1,a2,...aka_1,a_2,...a_k，这个人还记得某些时刻这个选手的当前分数为b1,b2,...,bnb_1,b_2,...,b_n（不是按时间轴顺序给出），现在问你这个选手初始积分有多少几种情况？数据范围：1 ≤ n ≤ k ≤

1.题目描述：A. Lala Land and Apple Treestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr lives in Lala

1.题目描述：C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowe

Number of Ways 题目链接 分类：思维、暴力1.题意概述给你n个数a[1…n]，要你找符合条件的i,j(2≤i≤j≤n−1)i,j(2≤i≤j≤n-1)，满足∑i−1k=1ak=∑jk=iak=∑nk=j+1ak\sum_{k=1}^{i-1}a_k=\sum_{k=i}^{j}a_k=\sum_{k=j+1}^{n}a_k，求符合条件的i,ji,j的组合数？2.解题

1.题目描述：B. Mike and stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has n strin

题目描述：E. Array Queriestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputa is an array of n posi

1.题目描述：B. Ilya and tic-tac-toe gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIlya is

1.题目描述：VisitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 855    Accepted Submission(s): 286Problem DescriptionWangye is

1.题目描述：B. Bash's Big Daytime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputBash has set out on a journe

1.题目描述：D. Cloud of Hashtagstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is an administrator

1.题目描述：A. Gamestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao works on a sports TV. He's spent

1.题目描述：B. Masha and geometric depressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMasha really

1.题目描述：A. Face Detectiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe developers of Looksery ha

2.中文描述：有在飞机上，两个多边形A和B。多边形A绕点P旋转，多边形B围绕点Q旋转。每个多边形围绕其点以顺时针方向以恒定的转速旋转，多边形旋转的转速值相等。您的任务是确定多边形之间是否存在冲突。一个碰撞的情况时，多边形至少有一个共同点。确保在此刻0，多边形A和B不相交，并且没有多边形被完全包含在另一个中。注意：多边形不一定是凸的;点P和Q可

1.题目描述：find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3281    Accepted Submission(s): 1209Pro

Journey to Tibet 题目链接 分类：dsu brute force1.题意概述​ 给出你n(1≤n≤1000)n(1≤n≤1000)个寺庙的坐标，相邻两个寺庙，你最多只能走30km30km现在问你总哪个起点出发，能够走尽可能多的寺庙，相同则输出输入编号的最小值。2.解题思路这题本质是求最大的连通块，连通问题，我们都可以考虑用并查集维护，父亲就是集合里面id最小的，