首页 > TAG信息列表 > 3038
HDU - 3038 - How Many Answers Are Wrong(带权并查集)
题目链接：https://vjudge.net/contest/353062#problem/F 题目大意：给你若干个区间和区间对应的值，求冲突的区间 带权并查集果题 #include<set> #include<map> #include<stack> #include<queue> #include<cmath> #include<cstdio> #include<cctype> #include<stringD - How Many Answers Are Wrong HDU - 3038【带权并查集】
How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24151 Accepted Submission(s): 8191 Problem Description TT and FF are ... friends. Uh... very very good friends -_____hdu-3038 （带权并查集）
输入样例 10 5 1 10 100 7 10 28 1 3 32 4 6 41 6 6 1 输出 1 因为输入描述的是闭区间，这里求【3-7】是求不出的，必须改为开区间 所以(0,10]=100, (6, 10]=28, (0, 3]=32 之后的问题就简单了 如果某一段区间的值和之前的值冲突则是错的 注意序列中可能存在负数，所以如果（0，1How Many Answers Are Wrong HDU - 3038 并查集，加权（路径）
TT and FF are ... friends. Uh... very very good friends -________-b FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers-_-!!(bored). Then, FF