acm
纸短情长的博客
这个作者很懒,什么都没留下…
展开
-
so easy
有ñ指向数组,索引来自1到n,这些点有两个操作。 1:1x标记点x不可用 2: 2x查询该点之后的第一个可用点的索引(包括Xx本身)。 输入 ñq Z1 X1 . . . ZqXq q是查询的数量,z是操作的类型,x是操作索引。1≤x<N <10 ^ 9, 1≤X<ñ<10 ^ 9,Z取值为1或2 输出 输出每个查询的答案。 ...原创 2019-09-11 22:52:42 · 343 阅读 · 0 评论 -
Carneginon
Carneginon was a chic bard. But when he was young, he was frivolous and had joined many gangs. Recently, Caneginon was to be crowned, because the king was shocked by his poems and decided to award him...原创 2019-09-11 23:42:45 · 150 阅读 · 1 评论 -
线段树算法代码
#include<stdio.h> #define MAX_LEN 1000 void build_tree(int arr[], int tree[], int node, int start, int end){ if(start == end){ tree[node] = arr[start]; } else{ int mid = (start + end)...原创 2019-09-14 11:47:22 · 306 阅读 · 0 评论 -
Honk's pool
As we all know, Honk hasnnpools, numbered as11~nn. There isa_iailiters water in theii-th pool. Every day, Honk will perform the following operations in sequence. Find the pool with the mo...原创 2019-09-14 18:03:13 · 381 阅读 · 0 评论