m0_51690407的博客

带权并查集：TT and FF are … friends. Uh… very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers-_-!!(bored).Then,

#include <iostream>#include <map>#include <vector>#include <algorithm>using namespace std;bool cmp(pair<string,int>A,pair<string,int>B){ //return A.second > B.second;//对map的第二个值排序 return A.first > B.

题目描述你有一张某海域NxN像素的照片，".“表示海洋、”#"表示陆地，如下所示：........##.....##........##...####....###........其中"上下左右"四个方向上连在一起的一片陆地组成一座岛屿。例如上图就有2座岛屿。由于全球变暖导致了海面上升，科学家预测未来几十年，岛屿边缘一个像素的范围会被海水淹没。具体来说如果一块陆地像素与海洋相邻(上下左右四个相邻像素中有海洋)，它就会被淹没。例如上图中的海域未来会变成如下样子：.........

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37309 Accepted Submission(s): 22612Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or b

圆桌问题是个非常典型的约瑟夫问题，我在写这题的时候主要是在学习动态数组vector下面就简单介绍一下动态数组的基础知识1.定义 vector<Type>L; Type为数据类型 L为变量名2.赋值 L.push_back(8) 在尾部添加元素3.插入 L.insert（L.begin()+i,k) 将 k 插入到第 i 个元素前4.删除尾部 L.push_back() 删除指定元素 L.erase(a.begin()+i) 删除第i+1个元素。5.清空：L.clear(