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

Автор Manurung, история, 9 лет назад, По-английски

Just wondering, Why Codeforces team doesn't setup the https for the site.

An apple to apple sites like Topcoder,Codechef, Hackerrank setup https on their site. Isn't it good if codeforces also setup HTTPS protocol?

Полный текст и комментарии »

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

Автор Manurung, 10 лет назад, По-английски

Hello everyone!

Google APAC 2015 — Round C will be held 2 hours after this post, the duration is 3 hours.

Good luck and have fun, and Please discuss about the problem here.

Полный текст и комментарии »

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

Автор Manurung, 10 лет назад, По-английски

First i want to say sorry because i make a new post for my question, and not make it in the comment of the editorial codeforces round FF.

I need help with 446A. Here's my code: http://codeforces.net/contest/447/submission/7148685

My approach is the following.

- Count the length of the sequence (left & right) for each index i until (n-1), while i start 
  from 0 and n is the number of element.
- i know that the result of the sequence would be like this (something that increasing) + 
  element that can be changed + (something that increasing).
- After that i just count the length of the sequence for each index.

I get WA on the 5th test, it's too big for me to analyse it (I can't even get access to the full example), nor I can get access to the full test data. Would this approach satisfy the time limits, and where is my mistake?

Полный текст и комментарии »

Теги dp
  • Проголосовать: нравится
  • -2
  • Проголосовать: не нравится

Автор Manurung, 11 лет назад, По-английски

Anybody know the idea behind this problem?

I am a newbie in DP, help me.

This is the problem : problem

Thanks fellow.

Полный текст и комментарии »

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