摘要: Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 using namespace std;const int maxn=100100 ;int f[maxn]; v... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(97) 评论(0) 推荐(0)
摘要: Mr. Cui is working off-campus and he misses his girl friend very much. After a whole night tossing and turning, he decides to get to his girl ... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(123) 评论(0) 推荐(0)
摘要: #include#define ll long longusing namespace std; const int maxn=100005;const int BUF=30000000;char Buf[BUF],*buf=Buf;inline void read(int&a){for(a=0;*... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(97) 评论(0) 推荐(0)
摘要: Do you like painting? Little D doesn’t like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing ... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(136) 评论(0) 推荐(0)
摘要: Zero and One are good friends who always have fun with each other. This time, they decide to do something on a tree which is a kind of graph that ther... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(80) 评论(0) 推荐(0)
摘要: Problem I: qwb VS 去污棒 Time Limit: 2 Sec Memory Limit: 256 MB Submit: 95 Solved: 36 [Submit][Status][Web Board] Descriptionqwb表白学姐失败后,郁郁寡欢,... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(93) 评论(0) 推荐(0)
摘要: 题意:给定一个数组,求区间中位数,保证给定区间长度是奇数思路:划分树求区间中位数#include #include #include #include using namespace std;#define MAX_SIZE 100005 int sorted[MAX_SIZE];//已经排好序的... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(77) 评论(0) 推荐(0)
摘要: There is a tree with nn nodes, each of which has a type of color represented by an integer, where the color of node ii is cici. The path betwe... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(121) 评论(0) 推荐(0)
摘要: sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no idea how to deal with mm com... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(159) 评论(0) 推荐(0)
摘要: 题意:有n个区间,对于第i个区间[li,ri]有liusing namespace std;namespace IO { const int MX = 4e7; //1e7占用内存11000kb char buf[MX]; int c, sz; void... 阅读全文
posted @ 2017-09-19 21:18 黑码的博客 阅读(113) 评论(0) 推荐(0)