iamskp99's blog

By iamskp99, history, 3 days ago, In English

Given an array, find out the longest increasing subsequence which is lexicographically smallest.

For example:

Given array : [9,2,10,3,11,4]

Possible LIS: [2,10,11],[2,3,4],[9,10,11],[2,3,11]

Lexicographically smallest LIS [2,3,4].

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By iamskp99, history, 2 months ago, In English

I was doing this problem from Atcoder : https://atcoder.jp/contests/abc128/tasks/abc128_c

Can someone please explain the solution?

I have seen the editorial but couldn’t understand it.

Solution link: https://atcoder.jp/contests/abc128/submissions/15518338 (Python)

Solution link: https://atcoder.jp/contests/abc128/submissions/5640467 (C++)

Read more »

 
 
 
 
  • Vote: I like it
  • -9
  • Vote: I do not like it

By iamskp99, history, 2 months ago, In English

I am doing this problem. Can someone please tell me why i am getting tle verdict. My submission is in python. My submission : https://codeforces.com/contest/1283/submission/88064624

Read more »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it