2016年10月_skymeteorite

原创 hdu5475 线段树单点更新

http://acm.hdu.edu.cn/showproblem.php?pid=5475Problem Description One day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X =

2016-10-26 19:01:54 239

原创 UVAlive6911 思维题set

http://vjudge.net/problem/UVALive-6911Last night, Kingdom of Light was attacked by Kingdom of Dark! The queen of Kingdom of Light, Queen Ar, was captured and locked inside a dark and creepy castle. The

2016-10-21 20:55:36 410

原创 hdu2987 map

http://acm.hdu.edu.cn/showproblem.php?pid=2978题意给出一些串用yes表示背过了该串，问最难背的子串（子串在yes中/子串在所有字串中的个数最小）若子串在所有字串中的个数小于m忽略思路暴力用map存下所有长度为k的子串及个数，最后遍历判断即可#include <iostream> #include <set> #include <cstdio

2016-10-18 21:43:04 406

原创 hdu1800 map统计

题意：有N个士兵，每个士兵有一个属于自己的等级，他们要学一项魔杖飞行技术，等级高的士兵可以教等级低的士兵，等级低的士兵不可以教等级高的士兵，一个士兵只能教一个士兵，一个士兵也只能被一个士兵教，能形成这样的教学关系的士兵组成一个教学组，需要一根魔杖，问最少需要多少根魔杖。题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1800——>>一个严格递增的序列需要

2016-10-09 14:01:13 366

原创 hdu1075 map

http://acm.hdu.edu.cn/showproblem.php?pid=1075题意翻译文本Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a

2016-10-09 13:34:58 326

原创 hdu4941map应用

http://acm.hdu.edu.cn/showproblem.php?pid=4941Problem Description There is a forest can be seen as N * M grid. In this forest, there is some magical fruits, These fruits can provide a lot of energy, Ea

2016-10-07 18:51:00 281

原创 We don't wanna work! STL应用

https://acm.bnu.edu.cn/v3/problem_show.php?pid=52308We don’t wanna work! Input: Standard Input Time Limit: See AtCoder ACM is an organization of programming contests. The purpose of ACM does not matter

2016-10-06 15:03:51 318

原创 hdu4585map应用

http://acm.split.hdu.edu.cn/showproblem.php?pid=4585Problem Description Shaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there.

2016-10-04 21:09:11 290

原创 hdu5918kmp

给出两个串，和一个p，子串只能每隔p匹配母串，问子串能匹配母串多少次，用的o（mlogn）就水过#include<cmath> #include<cstdio> #include<cstring> #include<iostream> typedef long long LL; using namespace std; const int maxn=1e6+5; typedef long lon

2016-10-04 16:18:45 106

原创 Similarity of Subtrees 深搜，hash

https://acm.bnu.edu.cn/v3/problem_show.php?pid=52310 problem descriptionDefine the depth of a node in a rooted tree by applying the following rules recursively: • The depth of a root node is 0. • Th

2016-10-04 16:14:26 256

skymeteorite