| Title |
User |
Message |
Place |
Date Posted |
| Ammar- tsk tsk! |
kirbyguy |
If you are trying to get marks, DON'T BEG HANSON FOR THEM. ACTUALLY GET THEM!!!!!!! |
ccc00s4 |
Dec 08, 2008 - 3:19:49 am UTC |
| Re: help. |
bleung91 |
nope, you have to be smart about how you input. |
p172ex8 |
Dec 08, 2008 - 2:50:38 am UTC |
| help. |
purohit3105 |
Do you use multi dimensional arrays for this? Just curious. |
p172ex8 |
Dec 08, 2008 - 2:48:21 am UTC |
| Re: I don't understand |
SourSpinach |
Yup |
wc01Sp5 |
Dec 07, 2008 - 9:56:56 pm UTC |
| Hint |
bbi5291 |
There isn't much to be said except that you need a data structure called the Binary Indexed Tree or Fenwick Tree in order to solve this problem. There's also a harder, slower, and more memory-hungry w... |
checker |
Dec 07, 2008 - 7:29:21 pm UTC |
| Re: How many queries are there at max |
bbi5291 |
Sorry about that, it is 0 |
intrvl |
Dec 07, 2008 - 7:27:11 pm UTC |
| How many queries are there at max |
taimla101 |
|
intrvl |
Dec 07, 2008 - 6:25:40 pm UTC |
| Re: Question |
bbi5291 |
I don't think there are any such cases. Whatever the case may be, assume that they're all uppercase. |
ccc05j5 |
Dec 07, 2008 - 6:05:53 pm UTC |
| Question |
Bob |
what if the inputted string is in lowercase - does it matter? |
ccc05j5 |
Dec 07, 2008 - 5:45:24 pm UTC |
| Clarification |
hansonw1 |
There are 4 numbers for every test case: N and K are different every time. |
wc01Sp2 |
Dec 06, 2008 - 5:15:32 pm UTC |
