| ENG RUS | Timus Online Judge |
Discussion of Problem 1296. Hyperjumpvtalgo21_gsavon Нет теста на одно отрицательное число... [1] // Problem 1296. Hyperjump 10 Mar 2021 04:41 По условию, при входных n = 1 и единственном отрицательном значении ответ должен быть 0, но accepted получается и при неправильном решении такого теста... Либо я чего-то не понимаю... Sandro (USU) Re: Нет теста на одно отрицательное число... // Problem 1296. Hyperjump 17 Mar 2021 02:24 The test was added. Thank you. Shree WA #4 [3] // Problem 1296. Hyperjump 23 Jan 2013 17:49 Hi guys, any ideas on test #4? getting WA there Aguero Re: WA #4 [1] // Problem 1296. Hyperjump 3 Mar 2013 18:05 один из элементов и есть максимальное значение 3 -5 90 -20 Sonyreboat Re: WA #4 // Problem 1296. Hyperjump 19 Dec 2013 13:49 работает и при таком вводе Ivan Re: WA #4 // Problem 1296. Hyperjump 8 Jun 2020 01:03 3 -1 -1 2 0blivium O(n) [1] // Problem 1296. Hyperjump 4 Jan 2019 02:58 Note, the required algorithm is known as the Kadane's algorithm and runs in O(n). Chirica Re: O(n) // Problem 1296. Hyperjump 16 Sep 2019 02:37 Thanks AdiZer0 В чем прикол? [1] // Problem 1296. Hyperjump 28 Jan 2019 11:46 Я написал рекурсию которая каждый раз делила отрезок на два и брала максимальный среди ответа всех таких отрезков которых поделила.(типо Merge Sort). У меня был memory limit на 3 тесте. Это значить рекурсия берет память? Das_Krebs Re: В чем прикол? // Problem 1296. Hyperjump 18 Mar 2019 18:40 Да, берёт. Рекурсия хранит итерации в стеке. Egor Stepanov [mikroz] help! WA9 [2] // Problem 1296. Hyperjump 28 Oct 2008 03:52 I can't understand why. Can anybody help me? Smilodon_am Re: help! WA9 [1] // Problem 1296. Hyperjump 22 Oct 2010 21:15 Try these two tests: 5 10 -5 3 -1 15 ---- 5 15 -1 3 -5 10 In both right answer is 22. Temur Re: help! WA9 // Problem 1296. Hyperjump 3 Dec 2015 10:01 Try this 3 -1 -1 1 >>1 gippotalamus Please ! Need help..my algoritm is wright, but ! WA9 [2] // Problem 1296. Hyperjump 15 Nov 2005 23:17 > > i found my mistake Edited by author 20.11.2005 00:44 matkir_ssau Re: Please ! Need help..my algoritm is wright, but ! WA9 [1] // Problem 1296. Hyperjump 10 Jan 2006 15:22 I have wa#9 but I can't found mistake :( what is test 9? Temur Re: Please ! Need help..my algoritm is wright, but ! WA9 // Problem 1296. Hyperjump 3 Dec 2015 09:58 3 -1 -1 1 try this Phan Hoài Nam - Đại học Ngoại ngữ Tin Học TP.HCM To everyone : Algorithm to solve this problem ! Very easy ! [3] // Problem 1296. Hyperjump 17 Feb 2009 18:56 calculate : fmax(n) = max(fmax(n-1)+value(n),value(n)); D_T_F Re: To everyone : Algorithm to solve this problem ! Very easy ! [1] // Problem 1296. Hyperjump 23 Mar 2009 04:24 Why? Consider p1 = 5, p2 = -2 fmax(1) = 5 fmax(2) = max( 5+(-2), -2 ) = 3 But if i = j = 1 fmax(2) = 5 Or I got wrong understanding of the task? Nguyen Dang Duy Re: To everyone : Algorithm to solve this problem ! Very easy ! // Problem 1296. Hyperjump 10 Dec 2011 11:17 F[i] is max values of sequence with the final element is a[i]. Finally, answer will be max( F[1], ... F[n] ). Sorry because of English. thebvog Re: To everyone : Algorithm to solve this problem ! Very easy ! // Problem 1296. Hyperjump 18 Jan 2012 20:58 It's wrong algorithm and more hard than right. Ont How do better? (my solution 0.031 208kb) [3] // Problem 1296. Hyperjump 3 Jan 2007 10:03 Best solution - 0.015. How to improve? I do not use array. Only 5 vars - (3 integer and 2 longint) I use inc([longint], number) instead of [longint]:= [longint] + number; Tural Neymanov Re: How do better? (my solution 0.031 208kb) // Problem 1296. Hyperjump 7 Feb 2008 18:13 Edited by author 07.02.2008 18:14 Tural Neymanov Re: How do better? (my solution 0.031 208kb) [1] // Problem 1296. Hyperjump 7 Feb 2008 18:14 my solution is also 0.031 and I used same "vars" as you and no array. my algo if O(N). and what is most interesting, one time the result was 0.015! after it i send same solution. it was 0.031 again. Edited by author 07.02.2008 18:15 S.77 Re: How do better? (my solution 0.031 208kb) // Problem 1296. Hyperjump 3 Aug 2011 16:44 I have 4 int vars, O(N) algo. I solved it 5 times already, and still (0.031,108). Useless. D_T_F Secod demonstration test [1] // Problem 1296. Hyperjump 23 Mar 2009 03:49 No more question. I read the text badly. Edited by author 23.03.2009 03:56 S.77 Re: Secod demonstration test // Problem 1296. Hyperjump 3 Aug 2011 15:57 I got it too. Sorry for this post ^^ For anyone who can't understand this example: remember that the first number means the size of a sequence given, not the first its element! Edited by author 03.08.2011 16:16 Varun Sharma C# - AC // Problem 1296. Hyperjump 5 May 2009 11:26 Hi, Well, the only thing to keep in mind for this problem is that final answer cannot be negative. If it comes to negative then output 0. Secondly, just start adding the numbers from the beginning and keep track of the maximum sum. For example, if you add first three terms and sum comes to 500 and then the fourth term is -500, then don't loose the previous 500 sum. Keep it somewhere, but make your new sum 0. Then start adding from 5th term (0 + 5th term + ....). Whenever you add just check whether the new one is greater than 500 or not ? If it is then replace it with that. Varun Edited by author 05.05.2009 11:30 Edited by author 05.05.2009 11:31 I am get tester... YES!!! I got AC!!! [4] // Problem 1296. Hyperjump 12 Aug 2005 12:33 time 0.046 memory 906 КБ (wow!!!) O(N) = (N * log N) c0der Re: YES!!! I got AC!!! [3] // Problem 1296. Hyperjump 12 Aug 2005 19:20 It isn't cool, 'cause the normal (and simple) solution is O(N),not O(N * log N). Tolstobrov_Anatoliy[Ivanovo SPU] Re: YES!!! I got AC!!! [2] // Problem 1296. Hyperjump 13 Aug 2005 20:13 I got AC 0.015 165 kb O(N) Edited by author 13.08.2005 20:17 Romko [Lviv NU] Re: YES!!! I got AC!!! [1] // Problem 1296. Hyperjump 21 Mar 2007 02:59 AC 0.015, 104 kb Memory :) Tural Neymanov Re: YES!!! I got AC!!! // Problem 1296. Hyperjump 7 Feb 2008 18:06 AC with 0.015, 135 kb Darth Niculus(Ivan Nicolae) A faster solution [2] // Problem 1296. Hyperjump 23 Feb 2005 17:10 Is there a faster solution that the one with 3 for's. I would apreciate if there is one. Vlad Veselov [PMG17,Vinnitsa - KNU,Kiev] O(N) time, O(1) additional memory // Problem 1296. Hyperjump 24 Feb 2005 19:00 Worrapat Boonyarittipong Re: A faster solution // Problem 1296. Hyperjump 17 Apr 2007 22:09 Yes, using dynamic programming (i use this method and stuck at WA 7) Neo Nomaly I have TLE... Help... [1] // Problem 1296. Hyperjump 12 Apr 2005 12:11 This is finding maxinmum sum in p array... I have TLE on test #13... Help... procedure solve; var i,j:longint; begin a[1]:=p[1]; max:=a[1]; for i:=2 to n do begin a[i]:=p[i]+a[i-1]; if max<a[i] then max:=a[i]; end; for i:=1 to n do for j:=i to n do if max<a[j]-a[i]+p[i] then max:=a[j]-a[i]+p[i]; end; Cybernetics Team Re: I have TLE... Help... // Problem 1296. Hyperjump 12 Apr 2005 17:10 This can be done in O(N), yours is O(N²) sokol Problem??? [2] // Problem 1296. Hyperjump 5 Jun 2004 21:52 For example: If N=3 and p1=3; p2=-3; p3=10; What i and j = ? Danica Porobic Re: Problem??? [1] // Problem 1296. Hyperjump 6 Jun 2004 02:13 i=j=3, answer: 10 sokol Re: Problem??? // Problem 1296. Hyperjump 10 Jun 2004 12:14 How can you calculate i and j? andrew 1296 [1] // Problem 1296. Hyperjump 21 Apr 2004 14:54 Can anybody answer my question? May numbers i and j be equal during the jump and what shall we do if n=0? Vesper Re: 1296 // Problem 1296. Hyperjump 21 Apr 2004 15:13 I suggest that i and j CAN be equal, for example if N=3, intensity is -1,2,-1, then both i and j are 2, and NO, N cannot be zero.
|