36th专题

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest To Miss Our Children Time

http://acm.hdu.edu.cn/showproblem.php?pid=4001 Problem Description Do you remember our children time? When we are children, we are interesting in almost everything around ourselves. A little thing or

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest Find the maximum

http://acm.hdu.edu.cn/showproblem.php?pid=4002Problem DescriptionEuler's Totient function, φ (n) [sometimes called the phi function], is used to determine the number of numbers less than n which

The 36th ACM/ICPC Asia Regional Beijing Sitehttp://acm.hdu.edu.cn/showproblem.php?pid=4046

比较难的线段树题,,, #include<iostream>#include<cstdio>#include<string.h>#define N 50005using namespace std;typedef struct NODE{int l;int r;int key;}Node;Node node[N<<2];char str[N];void build(int