YitongJun的博客

题解：看题目想到线段树，但是因为数据范围太大，显然不能直接使用线段树，所以这里应该加上离散化操作 代码如下： #include #include using namespace std; const int maxn=100005; int c[2*maxn],kind[maxn],tree[8*maxn],lazy[8*maxn]; int cl[maxn],cr[maxn]; map

Problem C. Zhenya moves from parents Time limit: 1 second Memory limit: 64 megabytes Zhenya moved from his parents’ home to study in other city. He didn’t take any cash with him, he only took his

Color the ball Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18680    Accepted Submission(s): 9319 Problem Description N个气球排成一排，从