| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
0
Auto comment: topic has been updated by vasandani68 (previous revision, new revision, compare). |
|
0
Auto comment: topic has been updated by vasandani68 (previous revision, new revision, compare). |
|
0
Auto comment: topic has been updated by vasandani68 (previous revision, new revision, compare). |
|
0
Can u please explain ur add and del functions. How are u maintaining the result after ignoring all those indexes which have occured 2 times? |
|
+5
What if n>2? |
|
+5
Can you prove why gcd of every pair should be 1? |
|
0
It is a naive approach and will time out.Please re-read the constraints and answer accordingly. |
|
0
Auto comment: topic has been updated by vasandani68 (previous revision, new revision, compare). |
|
0
can u explain in a bit naive way like what are active segments which u r taking about or actually what are the segments? if we take an 'i' then the possible 'j' which we can take are i+a,i+a+1,i+a+2,....i+b with the condition that all elements between i and j must be greater or equal to v. So what is the significance of sorting here and what are the segments which you are referring to? |
|
0
Auto comment: topic has been updated by vasandani68 (previous revision, new revision, compare). |
|
0
Auto comment: topic has been updated by vasandani68 (previous revision, new revision, compare). |
|
0
Any idea how to do this? |
