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

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
34:17:48
Register now »

→ Streams

CF Edu Round 173 Solution Discussion

By aryanc403

Before stream 36:27:48

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	160
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	Dominater069	154
8	awoo	154
10	luogu_official	151

View all →

→ Find user

→ Recent actions

Detailed →

How to solve CPAIR(counting pairs) on SPOJ?

Revision en1, by vasandani68, 2016-05-11 18:15:43

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)