摘要:
Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clea 阅读全文
摘要:
D. Degree Set time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Degree Set time limit p 阅读全文
摘要:
E. Hag's Khashba time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output E. Hag's Khashba time l 阅读全文
摘要:
DreamGrid has integers . DreamGrid also has queries, and each time he would like to know the value of for a given number , where , . Input There are m 阅读全文
摘要:
DreamGrid is learning the LIS (Longest Increasing Subsequence) problem and he needs to find the longest increasing subsequence of a given sequence of 阅读全文
摘要:
A. Popularity on Facebook time limit per test 2.0 s memory limit per test 256 MB input standard input output standard output A. Popularity on Facebook 阅读全文
摘要:
B. Spy Duel time limit per test 2.0 s memory limit per test 256 MB input standard input output standard output B. Spy Duel time limit per test 2.0 s t 阅读全文
摘要:
C. Ekaterinburg Pyramids time limit per test 2.0 s memory limit per test 256 MB input standard input output standard output C. Ekaterinburg Pyramids t 阅读全文