Cruiying

分类

2-sat(1) BSGS(2) dfs(2) dp(63) dp + 线段树(1) floyd(3) Hash(1) KM算法(1) Kruskal重构树(2) LCA(6) manachar(2) Mendix(4) tarjan(1) 中位数(1) 主席树(2) 二分(3) 分数规划(3) 前缀和优化dp(2) 单调栈(6) 单调队列(1) 单调队列优化dp(1) 博弈(2) 后缀数组(15) 字典树(1) 差分约束系统(1) 并查集(4) 异或(2) 思维(2) 思维题(4) 扩展欧几里得算法(1) 拉格朗日插值(2) 数论(8) 未归档(15) 构造(1) 枚举(1) 模拟(3) 模板(1) 水题(4) 矩阵加速(2) 线段树(3) 网络流(2) 莫比乌斯反演(2) 莫队(4) 蓝桥杯(1) 规律(2) 贪心(2) 输入输出(1) 题解(1)

/ 注册

全部文章（共193篇）

The Preliminary Contest for ICPC China Nanchang National Invitational J题 Distance on the tree

DSM(Data Structure Master) once learned about tree when he was preparing for NOIP(National Olympiad in Informatics in Provinces) in Senior High School...

2019-04-21

0 669

The Preliminary Contest for ICPC China Nanchang National Invitational J题 Distance on the tree

DSM(Data Structure Master) once learned about tree when he was preparing for NOIP(National Olympiad in Informatics in Provinces) in Senior High School...

2019-04-21

0 422

The Preliminary Contest for ICPC China Nanchang National Invitational K题 MORE XOR

Given a sequence of nn numbers a1 ,a2,⋯,an and three functions. Define a function f(l,r)f(l,r) which returns \oplus a[x]⊕a[x] (l \le x \le rl≤x≤r). Th...

2019-04-21

0 673

The Preliminary Contest for ICPC China Nanchang National Invitational K题 MORE XOR

Given a sequence of nn numbers a1 ,a2,⋯,an and three functions. Define a function f(l,r)f(l,r) which returns \oplus a[x]⊕a[x] (l \le x \le rl≤x≤r). Th...

2019-04-21

0 363

The Preliminary Contest for ICPC China Nanchang National Invitational I题 Max answer

Alice has a magic array. She suggests that the value of a interval is equal to the sum of the values in the interval, multiplied by the smallest value...

2019-04-21

0 443

The Preliminary Contest for ICPC China Nanchang National Invitational I题 Max answer

Alice has a magic array. She suggests that the value of a interval is equal to the sum of the values in the interval, multiplied by the smallest value...

2019-04-21

0 417

The Preliminary Contest for ICPC China Nanchang National Invitational M题 Subsequence

题意：给你一个文本字符串P，n个字符串si，然后判断字符串si是不是文本串P的子序列枚举给个字符最早出现的位置就可以了 #include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; char s[max...

2019-04-21

0 501

The Preliminary Contest for ICPC China Nanchang National Invitational M题 Subsequence

题意：给你一个文本字符串P，n个字符串si，然后判断字符串si是不是文本串P的子序列枚举给个字符最早出现的位置就可以了 #include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 5; char s[max...

2019-04-21

0 465

The Preliminary Contest for ICPC China Nanchang National Invitational H题 Coloring Game

David has a white board with 2×N grids.He decides to paint some grids black with his brush.He always starts at the top left corner and ends at the bot...

2019-04-21

0 436

The Preliminary Contest for ICPC China Nanchang National Invitational H题 Coloring Game

David has a white board with 2×N grids.He decides to paint some grids black with his brush.He always starts at the top left corner and ends at the bot...

2019-04-21

0 377