一个小渣渣的博客：）

日常算法刷题整理 一、字符串处理 二、数学 三、数据结构 1、区间问题 1.1、树状数组 板子： #include<iostream> #include<vector> #define type int using namespace std; // n:元素个数，m:操作次数 int n, m; vector<type> a, c; // a是原数组，c是树状数组 int lowbit(int x) { return x&(-x); } void

One-Dimensional Battle Ships Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of n square cells (that is, on a 1 × n table). At the beginning of the game Alice puts k ships on the field withou

1052 Linked List Sorting (25分) A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are

Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pieces and sewing the remaining parts...

我的思路其实很简单 这题是比较标准的 并查集 类型的题目。 主要思想就是一个常规的并查集数组 f[MAXN] 保存各个成员之间的朋友关系 那么不同兴趣圈的人怎么建立朋友关系呢？ 我的办法是通过另一个变量存储不同的兴趣圈里的人是哪些，然后在读取数据的时候，一个人若是发现有兴趣A,则遍历一遍兴趣A所在的兴趣圈， 与...