LCS problem.Need help,please.

→ Pay attention

Before contest
Codeforces Round 995 (Div. 3)
02:09:58
Register now »

→ Streams

Codeforces Round 995 Solution Discussion

By aryanc403

Before stream 04:29:58

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

View all →

→ Top contributors

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

View all →

→ Find user

→ Recent actions

MikeMirzayanov → Goodbye, 2024. Hello, 2025!
Little_CarT → Why there's no Tourist in magic?
Morrison_Sec → Why We Can Only Change Our Rank to LGM?
rmz → I have a theory... a rating theory
luogu_official → 【LGR-210-Div.3】Luogu Round 210 Announcement
BledDest → Codeforces Round 995 (Div. 3)
Shisuko → [Help] On making "magician & assistant" problems---How to stop functions from sharing info?
atcoder_official → UNIQUE VISION Programming Contest 2024 Christmas (AtCoder Beginner Contest 385) Announcement
MikeMirzayanov → Rule Restricting the Use of AI [revision 2024-09-14]
VSS100018_M.Aayan → VSS the project from sundar stem Pakistan,Lahore
gkosthefinalboss7 → Experiment...
cry → Codeforces Round 993 (Div. 4) Editorial
NeroZein → Factors that affect rating growth
awoo → Educational Codeforces Round 143 Editorial
CP_xam_lon → A strategy to save CP from the influence of next gen LLMs
shiftpsh → Candidate Teams to the 2025 ICPC Asia Pacific Championships
Tanzim_bn → Problem of the Year 2024
Qingyu → GPT-o3 can become a red coder?
BledDest → Educational Codeforces Round 172 — Editorial
Evirir → Codeforces Round 994 (Div. 2)
Swap-nil → Codeforces Round #956 (Div. 2) and ByteRace 2024 Editorial
Swayam78 → Need Help : Why my N*N*log(N) soln fails for N=1000,
phsads → Changing my pfp every day for december (or at least i'll try to)
wakanda-forever → Finding an upperbound for the minimum number of iterations on the Euler Totient Function
Error_Yuan → How to Participate in Luogu Contests

Detailed →

LCS problem.Need help,please.

Revision en2, by Muhammad_mhs, 2020-04-16 10:42:41

How to find Lexicographical smallest longest common subsequence ??

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		Muhammad_mhs	2020-04-16 10:42:41	18
	en1		Muhammad_mhs	2020-04-16 10:15:28	81	Initial revision (published)