Hello, i am struggling to solve this problem from SPOJ. Can anybody give me some hints? Thanks in advance!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hello, i am struggling to solve this problem from SPOJ. Can anybody give me some hints? Thanks in advance!
Hello, can anybody give me hints for this problem? I think heavy light decomposition could handle the type-1 query, but how about the type-2 query?
Hi!
I just learned to implement suffix array. I got quite confused about why i need to add a terminating character to my input string such as a '$' or '#'. I tried solving problem without the terminating character, some got accepted, some got WA. Any comments? Thank you so much!
FYI, i learned suffix array from CP 3 by Steven and Felix Halim.
Hello. I'd like to ask how to request CF API using AJAX. Here is my code :
$.ajax({
type : "GET" ,
url : "http://codeforces.net/api/problemset.problems?tags=implementation",
success : function(data) {
alert("success");
} ,
error : function(data) {
alert('fail');
}
});
The AJAX call returns nothing. How do I solve this issue? Thanks!
Is it possible to solve Uva 11790 using O(n log k) LIS? I kept getting WA using O(n log K) LIS, so i change to O(n^2) and get accepted. The problem's constraint is not clear though :(
Hello everyone!
recently I am thinking .. if there is Virtual Participation for contest, why there isn't Virtual Rating Change. Sometimes it is good to know our rating changes (at least for me). What do you guys think?
is there a way to sort the problem in the problemset according to their tag? for example, i'd like to see all data structure problems, then the problemset only show the problem related to data structure. Thanks in advance !
I recently studied about greedy algorithm. But all I do is guessing. Can someone share a good documentation about proofing a correctness of greedy algorithm? Or maybe greedy algorithm is based on guess?
Thanks in advance! Happy Coding!
hmm.. i wonder.. what compiler is similar to GNU C++? recently i got really confused. my program output correct answer on my computer, but the judge give me "wrong answer" verdict. can somebody help me? sorry for my bad english :D
Название |
---|