How to solve CPAIR(counting pairs) on SPOJ? - Codeforces

→ Pay attention

Before contest
Rayan Programming Contest 2024 - Selection (Codeforces Round, Div. 1 + Div. 2)
5 days
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	3993
2	jiangly	3743
3	orzdevinwang	3707
4	Radewoosh	3627
5	jqdai0815	3620
6	Benq	3564
7	Kevin114514	3443
8	ksun48	3434
9	Rewinding	3397
10	Um_nik	3396

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	156
8	TheScrasse	154
9	Dominater069	153
10	nor	152

View all →

→ Find user

→ Recent actions

Detailed →

How to solve CPAIR(counting pairs) on SPOJ?

Revision en2, by vasandani68, 2016-05-12 13:06:35

How can it be solved using Fenwick trees , DSU etc? Problem link- (http://www.spoj.com/problems/CPAIR/)

Tags

fenwick tree, dsu, segment trees

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)