Timeline for The group of sequential positive numbers with the highest sum?
Current License: CC BY-SA 3.0
38 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 27 at 17:16 | answer | added | Jordan | timeline score: 1 | |
| Aug 1, 2018 at 6:15 | answer | added | Dom Hastings | timeline score: 0 | |
| Jul 31, 2018 at 13:41 | answer | added | O.O.Balance | timeline score: 0 | |
| Jul 31, 2018 at 13:24 | answer | added | O.O.Balance | timeline score: 0 | |
| Jul 31, 2018 at 13:05 | answer | added | Kevin Cruijssen | timeline score: 1 | |
| Jul 31, 2018 at 13:03 | answer | added | Titus | timeline score: 0 | |
| Jul 31, 2018 at 12:39 | answer | added | Luis felipe De jesus Munoz | timeline score: 2 | |
| Dec 16, 2015 at 19:00 | history | edited | NinjaBearMonkey | CC BY-SA 3.0 | Elegant is not an objective winning criterion |
| Feb 23, 2015 at 23:01 | answer | added | Demayl | timeline score: 0 | |
| Feb 23, 2015 at 7:38 | answer | added | jimmy23013 | timeline score: 2 | |
| Feb 22, 2015 at 20:27 | answer | added | Martin Ender | timeline score: 4 | |
| Feb 25, 2014 at 13:38 | history | edited | Doorknob | edited tags | |
| May 9, 2012 at 9:09 | answer | added | tmartin | timeline score: 1 | |
| Jan 8, 2012 at 15:18 | comment | added | user unknown | Why did you accept M42's solution which isn't the shortest? | |
| Jan 4, 2012 at 16:29 | answer | added | Ilmari Karonen | timeline score: 2 | |
| Jan 4, 2012 at 16:11 | comment | added | Ilmari Karonen | @AlNewkirk: I copyedited your post a bit, and removed the second copy of the example input. Could you please check that I didn't accidentally change the meaning of what you wrote. Also, as cemper93 notes, you really should clarify the winning criterion and tag your post accordingly (as code-golf or code-challenge for example). | |
| Jan 4, 2012 at 16:06 | history | edited | Ilmari Karonen | CC BY-SA 3.0 | copyedit, remove repetition |
| Jan 3, 2012 at 3:36 | vote | accept | Al Newkirk | ||
| Jan 3, 2012 at 0:45 | answer | added | Steven Rumbalski | timeline score: 3 | |
| Jan 2, 2012 at 21:08 | answer | added | Dillon Cower | timeline score: 6 | |
| Jan 2, 2012 at 19:57 | comment | added | arrdem | @userunknown I stand corrected. | |
| Jan 2, 2012 at 16:19 | history | edited | user unknown | removed the tags 'optimization' and 'sorting' | |
| Jan 2, 2012 at 13:58 | comment | added | cemper93 | @Al Newkirk: You should specify which solution will be the winner. If this shall be the solution with the least characters (standard code-golf), please add a code golf tag. Also, don't say "use the following input", but specify something like "the input will be on standard input, and use the following input to test your submission". | |
| Jan 2, 2012 at 11:42 | answer | added | Toto | timeline score: 1 | |
| Jan 2, 2012 at 8:54 | comment | added | Peter Taylor | @userunknown, you're right that it's not a perfect duplicate, but it's so close that it's not worth having as a separate challenge. | |
| Jan 2, 2012 at 8:01 | comment | added | Al Newkirk | @M.Joanis yes, you're right, the example input line got pasted incorrectly, .... sorry about that. | |
| Jan 2, 2012 at 7:59 | history | edited | Al Newkirk | CC BY-SA 3.0 | added 162 characters in body |
| Jan 2, 2012 at 7:46 | comment | added | Al Newkirk | Sorry @cemper93, what could I have said to make it more clear? I figured it was self-explanatory. | |
| Jan 2, 2012 at 5:32 | comment | added | user unknown | @rmckenzie: I guess you're wrong. See example: printf "1\n2\n-1\n4\n" | ./sum \\ \n 6. He shifts the values in the end. You may jump over negative values, if you gain more points with the value on the other side, than it costs, to pick the negative value, while here, it is an absolute barrier, which you can't cross. | |
| Jan 2, 2012 at 4:42 | comment | added | arrdem | @userunknown right idea, wrong words. The other problem uses an UNSIGNED INT generator, this uses standard INTs. | |
| Jan 2, 2012 at 3:52 | answer | added | user unknown | timeline score: 1 | |
| Jan 2, 2012 at 3:34 | comment | added | user unknown | not duplicate, since the other question is not restricted to positive ints. | |
| Jan 1, 2012 at 15:48 | answer | added | marinus | timeline score: 2 | |
| Jan 1, 2012 at 2:44 | comment | added | Peter Taylor | possible duplicate of Find largest sum of subsequence | |
| Dec 31, 2011 at 21:23 | answer | added | Joanis | timeline score: 1 | |
| Dec 31, 2011 at 21:17 | comment | added | Joanis | Wouldn't it give 131? 20+9+76+5+4=114 and 19+80+32=131 | |
| Dec 31, 2011 at 21:06 | comment | added | cemper93 | This lacks an objective winning criterion. Also, as the rules are, I could just print 179 and have a valid solution. | |
| Dec 31, 2011 at 20:48 | history | asked | Al Newkirk | CC BY-SA 3.0 |