——————暂时没过就挂着吧——————
等我学会后缀自动机
侠影之谜
展开
-
HDU 4893 Wow!Such a sequence!(线段树+斐波那契二分)
Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4884 Accepted Submission(s): 1425Problem Description Recently, Doge go...原创 2018-06-22 10:01:26 · 268 阅读 · 0 评论 -
HDU 4777 Rabbit Kingdom (树状数组+离线+思维)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4777#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-06 15:21:04 · 156 阅读 · 0 评论 -
HDU 4467 Graph (莫队思想+图的分块)*
题目链接:acm.hdu.edu.cn/showproblem.php?pid=4467#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x,y) sca...原创 2018-09-14 13:42:27 · 414 阅读 · 1 评论 -
BZOJ 2154 Crash 的数字表 (莫比乌斯反演推导+分块加速)*
题目链接:https://cn.vjudge.net/problem/HYSBZ-2154#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z)...原创 2018-09-10 20:09:18 · 165 阅读 · 0 评论 -
Codeforces 343D Water Tree(线段树+DFS序)*
Mad scientist Mike has constructed a rooted tree, which consists of n vertices. Each vertex is a reservoir which can be either empty or filled with water.The vertices of the tree are numbered from 1...原创 2018-08-16 15:26:52 · 130 阅读 · 0 评论 -
Codeforces 877E Danil and a Part-time Job (DFS序+线段树)
Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher.Danil works in a rooted tree (undirected connected acyclic graph) with ...原创 2018-08-18 16:45:57 · 252 阅读 · 0 评论 -
HDU 6333 Problem B. Harvest of Apples (莫队算法+数学思维)
Problem B. Harvest of ApplesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2073 Accepted Submission(s): 804 Problem DescriptionThe...原创 2018-08-02 22:54:37 · 226 阅读 · 3 评论 -
HDU 6351 Beautiful Now (暴力搜索)
Beautiful Now Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1579 Accepted Submission(s): 584 Problem Description A...原创 2018-08-07 15:06:51 · 485 阅读 · 0 评论 -
Codeforces round 294E Shaass the Great (树形DP+节点扫描式DP)
The great Shaass is the new king of the Drakht empire. The empire has n cities which are connected by n - 1 bidirectional roads. Each road has an specific length and connects a pair of cities. There's...原创 2018-08-14 16:33:31 · 179 阅读 · 0 评论 -
HDU 6299 Balanced Sequence (字符串贪心)*
Balanced Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5225 Accepted Submission(s): 1339 Problem Description ...原创 2018-08-01 06:23:09 · 181 阅读 · 0 评论 -
HDU 4747 Mex(线段树维护mex)经典
MexTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3851 Accepted Submission(s): 1278 Problem DescriptionMex is a function on a se...原创 2018-08-09 07:11:58 · 993 阅读 · 0 评论 -
UVA 11582 巨大的斐波那契数! (打表+周期规律)
The i’th Fibonacci number f(i) is recursively defined in the following way: • f(0) = 0 and f(1) = 1 • f(i + 2) = f(i + 1) + f(i) for every i ≥ 0 Your task is to compute some values of this sequence.In...原创 2018-07-22 10:23:29 · 712 阅读 · 0 评论 -
ZOJ 1145 Dreisam Equations(简单回溯)
During excavations in the Dreisamwuste, a desert on some far away and probably uncivilized planet, sheets of paper containing mysterious symbols had been found. After a long investigation, the project...原创 2018-07-21 06:18:32 · 453 阅读 · 0 评论 -
Codeforces Round 877DOlta and Energy Drinks (BFS+思维优化)
Olya loves energy drinks. She loves them so much that her room is full of empty cans from energy drinks.Formally, her room can be represented as a field of n × m cells, each cell of which is empty or ...原创 2018-07-06 19:49:08 · 283 阅读 · 0 评论 -
HDU 5441 Travel (最小生成树+离线处理)
TravelTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4420 Accepted Submission(s): 1462Problem DescriptionJack likes to travel around the w...原创 2018-06-16 17:25:58 · 398 阅读 · 3 评论 -
HDU 4678 Mine (bfs+博弈SG)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4678#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-10-29 15:49:04 · 131 阅读 · 0 评论