这篇博客讲述了在解决HDU 3397问题中遇到的挑战，作者经历了多次提交错误并最终找到问题所在。该问题涉及到线段树的使用，主要包括区间内的数值置0、置1、旋转操作，以及查询区间和与计算连续1的个数。关键在于，当线段树节点的值不为-1时，不需要考虑异或操作，并在pushdown过程中将XOR设为0。
Sequence operation
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6032 Accepted Submission(s): 1784
Problem Description
lxhgww got a sequence contains n characters which are all '0's or '1's.
We have five operations here:
Change operations:
0 a b change all characters into '0's in [a , b]
1 a b change all characters into '1's in [a , b]
2 a b change all '0's into '1's and change all '1's into '0's in [a, b]
Output operations:
3 a b output the number of '1's in [a, b]
4 a b output the length of the longest continuous '1' string in [a , b]
We have five operations here:
Change operations:
0 a b change all characters into '0's in [a , b]
1 a b change all characters into '1's in [a , b]
2 a b change all '0's into '1's and change all '1's into '0's in [a, b]
Output operations:
3 a b output the number of '1's in [a, b]
4 a b output the length of the longest continuous '1' string in [a , b]
Input
T(T<=10) in the first line is the case number.
Each case has two integers in the first line: n and m (1 <= n , m <= 100000).
The next line contains n characters, '0' or &#
Each case has two integers in the first line: n and m (1 <= n , m <= 100000).
The next line contains n characters, '0' or &#
最低0.47元/天 解锁文章
283
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
