|
|
вернуться в форумHow to solved it in time limit? I use sort bin-tree,but time overflow...... Послано aaakkk 2 мар 2002 19:19 Re: How to solved it in time limit? I use sort bin-tree,but time overflow...... Послано zdv 11 май 2002 12:02 I used dihotomy search of student`s number in teacher`s list. Teacher`s array is already sorted, so it works. My program worked 2.5 seconds. I use binary search and it's nowrking. |
|
|