Обсуждение @ 1025. Демократия в опасности @ Timus Online Judge

can anybody tell me which sorting algo to apply? i am exceeding time limit

Послано Anupam Ghosh,Bengal Engg and Science University,Shibpur,India 8 дек 2007 15:52

Re: can anybody tell me which sorting algo to apply? i am exceeding time limit

Послано Anupam Ghosh,Bengal Engg and Science University,Shibpur,India 8 дек 2007 17:25

i have tried this with heap,bubble and insertion sort. Even i tried using sorted link list. then i tried this without any sorting with arrays. still my time limit is exceeding for test 1 . please give me some hints.

Re: can anybody tell me which sorting algo to apply? i am exceeding time limit

Послано Alias (Alexander Prudaev) 8 дек 2007 19:58

the timel limit is not because of sorting.
the bubble sort must work fast enough

Re: can anybody tell me which sorting algo to apply? i am exceeding time limit

Послано Alias (Alexander Prudaev) 8 дек 2007 20:03

you can show me your code and i will find your bug
twoalias@inbox.ru

Re: can anybody tell me which sorting algo to apply? i am exceeding time limit

Послано Anupam Ghosh,Bengal Engg and Science University,Shibpur,India 10 дек 2007 10:26

i have omitted the bug of exceeding time limit. but now it says wrong answer. can anybody provide me some test cases please
?

Обсуждение задачи 1025. Демократия в опасности