Hi, Round #288 was Div. 1 and Div. 2 yesterday.

What happened ? Now I see it's a Div .2 Only contest !

Is this a mistake ? Or plan changed ?

# | User | Rating |
---|---|---|

1 | tourist | 3803 |

2 | jiangly | 3707 |

3 | Benq | 3627 |

4 | ecnerwala | 3584 |

5 | orzdevinwang | 3573 |

6 | Geothermal | 3569 |

6 | cnnfls_csy | 3569 |

8 | Radewoosh | 3542 |

9 | jqdai0815 | 3532 |

10 | gyh20 | 3447 |

# | User | Contrib. |
---|---|---|

1 | awoo | 163 |

2 | maomao90 | 160 |

3 | adamant | 157 |

4 | maroonrk | 155 |

5 | -is-this-fft- | 150 |

6 | SecondThread | 147 |

6 | atcoder_official | 147 |

6 | Petr | 147 |

9 | nor | 146 |

10 | TheScrasse | 145 |

Hi, Round #288 was Div. 1 and Div. 2 yesterday.

What happened ? Now I see it's a Div .2 Only contest !

Is this a mistake ? Or plan changed ?

Hi, bro !

I was trying to solve problem 126C - E-reader Display !

In this problem n is at most 2000, and my algorithm was O(n*n*log n).

getting input with cin : 5857002

getting input with scanf : 5858216

But my code got TLE , and I can't find it reason.

If you know it, please tell me !

Hi !

I am trying to answer problem 155 at ACM.SGU.RU site .

My algortihm is sort by a[i] elements , then create a BST by k[i] elements.

I know my algorithm in worse case is O(n^2) and n can be 50000 ! So my answer get TLE .

What can I do for this problem ? Is my algorithm wrong or can be optimize ?

Hi :)

In recent Codeforces contests , we see many problem with "Geometry" tag ! so I decide to learn Geometry algorithms and formula !

What must I do ?

Hi :) We have two string with same size ! ( n = strings.size() )

I want an algorithm with O(n.lg n) , to find LCS of this strings .

What is best Order of this problem ? I can find it with O(n^2) by using dp !

sry 4 my bad English! :|

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/14/2024 00:52:48 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|