MasterG

Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to ma

Problem Description 度熊手上有一本字典存储了大量的单词，有一次，他把所有单词组成了一个很长很长的字符串。现在麻烦来了，他忘记了原来的字符串都是什么，神奇的是他竟然记得原来那些字符串的哈希值。一个字符串的哈希值，由以下公式计算得到： H(s)=∏i≤len(s)i=1(Si−28) (mod 9973) Si代表 S[i] 字符的 ASCII 码。 请帮助

Problem Description The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence of numbers a1, a2, ..., an, if we move th

It’s universally acknowledged that there’re innumerable trees in the campus of HUST. In 8102, Alisa took fishing as her business. When she was walking along the bank and forgot the distance gradually,...

  题意： In a galaxy far, far away, there are two integer sequence a and b of length n. b is a static permutation of 1 to n. Initially a is filled with zeroes. There are two kind of operations: 1. add ...

题目：http://acm.hdu.edu.cn/showproblem.php?pid=6356 用线段树维护一个最小最大值搞一下可以过： #include<iostream> #include<stdio.h> #include<string.h> #include<algorithm> #include<vector> #de...

题目：http://acm.hdu.edu.cn/showproblem.php?pid=6430 题意：一棵树上每个节点权值为v[i]，每个节点的heard值是：以它为LCA的两个节点的GCD的最大值，要求输出每个节点的heard值 题解：小于 100000 的数最多只有一百多个约数. 建出所有点的约数线段树, 然后线段树合并, 重复的单点就可以对答案产生贡献. 当然有省内存的做法, DSU...