Блог пользователя Rudro25

Автор Rudro25, 3 года назад, По-английски
We are sorry for our many mistakes.

There Have many Solution and approach of any problem . We will discuss here only one approach for every problem which we found easy way .

Contest Announcement link : https://codeforces.com/blog/entry/83016

Previousely you could only virtually , now the contest is open for practice .

Invitation link for the contest : https://codeforces.com/contestInvitation/df49ade9db566204acd3653a7c3cacad088f6f1e

A. Square Field

Tutorial
Solution in c++

Idea & Tutorial & Solution : Rudro25

B. Win Or Lose

Tutorial
Solution in c++

Idea : Rudro25 Tutorial & Solution : Muhammad_Saidul_Islam

C. Delete and insert

Tutorial
Solution in c++

Idea : Muhammad_Saidul_Islam Tutorial & Solution : Rudro25

Muhammad_Saidul_Islam's solution with less complexity :

Solution

D. Triple Fighting

Tutorial
Solution in c++

Idea & Tutorial & Solution : Rudro25

E. Absolute value and divisors

Tutorial
Solution in c++

Idea : Muhammad_Saidul_Islam Tutorial & Solution : Rudro25

Muhammad_Saidul_Islam's solution with less complexity :

solution

F. Home Work

Tutorial
Solution in c++

Idea & Tutorial & Solution : Rudro25

  • Проголосовать: нравится
  • +39
  • Проголосовать: не нравится

»
3 года назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

waiting for the next round and thanks for the editorial.

»
3 года назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

Since these problems are unofficial and CF does not give them ratings, Can you mention what are them based on your experience?

»
3 года назад, # |
Rev. 2   Проголосовать: нравится +1 Проголосовать: не нравится

last problem can be solved using dp => dp[N][26] dp[i][j] => upto index i max sorted subsequence ending at char('a' + j) state dp[i][j] = dp[i - 1][j] dp[i][s[j] - 'a'] = 1 + max(dp[i - 1]['a' to s[j] - 'a'])
Code (C++)
»
3 года назад, # |
Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

In problem D : Let's take this input :

2

1 3 3 4 6 6

The editorial solution output is 1 team, but it can be 2 like this : 1 3 4 and 3 6 6

Am I wrong ?