江湖小虾米的博客

1005. F．Snowy Roads最小生成树Kruskal算法    Description  There was a heavy snow in the town yesterday. Some roads in the town are covered with thick snow so that t

1321. RobotConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionKarell Incorporated has designed a new exploration robot that has the ability to explore new terrains, thi

#include cout // cout setiosflags(ios::fixed)

个人笔记

#include #include #include #include using namespace std;const int maxn = 10010;int deepest = 0;vector city[maxn];int deep_r[maxn], p = 0;bool visit[maxn] = {false};bool visit1[maxn] = {fa

题目链接：点击打开链接问题：字符串中连续出现K次的字符为坏键.AC思路：用vector记录每个字符出现的位置（遍历一遍字符串），然后根据每个字符出现次数，若不能整除K，则说明该字符合法;否则依次对比出现的位置pos[i + K - 1] - pos[i] == K - 1，若是，则该字符不合法；否则记为合法。代码如下：#include #include #include #include