This problem is from https://acm.hdu.edu.cn/ I don't have the exact link to the problem though. ![ ]()
I tried many approaches , either they are in efficient or way too complicated .
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
This problem is from https://acm.hdu.edu.cn/ I don't have the exact link to the problem though. ![ ]()
I tried many approaches , either they are in efficient or way too complicated .
Name |
---|
I don't have the exact link to the problem though. ![ ](
How come? Could you add a bigger screenshot, so it would be clear where its from — to be sure it's not ongoing contest?
My approach is also linear, but I am not sure how to explain it.my approach was to work on individual element as subarray sum need to be > 0 , to be X as majority element, so assign X as +1 and rest element will contribute -1.so we could make consecutive blocks of 0 and >0 and apply running sum , before this we have to push all identical element in vector array storing their index.
But I guess this is your question
https://dmoj.ca/problem/dmopc20c2p5/editorial
This problem's link is: https://acm.hdu.edu.cn/showproblem.php?pid=7020