How can it be solved using Fenwick trees , DSU , Segment trees etc?↵
Problem link- (http://www.spoj.com/problems/CPAIR/)
Problem link- (http://www.spoj.com/problems/CPAIR/)
→ Pay attention
→ Top rated
| # | 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 |
→ Top contributors
| # | 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 |
→ Find user
→ Recent actions
How to solve CPAIR(counting pairs) on SPOJ?
Difference between en2 and en3,
changed 16 character(s)
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
vasandani68 | 2016-05-12 21:22:47 | 16 | Tiny change: 'ees , DSU etc?\nPro' -> 'ees , DSU , Segment trees etc?\nPro' | |
| en2 |
|
vasandani68 | 2016-05-12 13:06:35 | 5 | ||
| en1 |
|
vasandani68 | 2016-05-11 18:15:43 | 144 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/26/2026 04:21:55 (i1).
Desktop version, switch to mobile version.
Supported by
