Timeline for Smallest subarray problem
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2020 at 12:33 | answer | added | Jakube | timeline score: 1 | |
| Jul 3, 2020 at 11:18 | history | edited | Dave | CC BY-SA 4.0 |
edited body
|
| Jul 3, 2020 at 11:04 | history | edited | Dave | CC BY-SA 4.0 |
added 252 characters in body
|
| Jul 3, 2020 at 9:52 | comment | added | Dave | Smallest way = How to split the original array into as small a number of subarrays as possible where all the subarrays satisfy the requirement. I updated to include my current attempt, which is a working N^2. | |
| Jul 3, 2020 at 9:52 | history | edited | Dave | CC BY-SA 4.0 |
edited body
|
| Jul 3, 2020 at 9:51 | comment | added | Dave | "How does the first subarray satisfy the condition? There is no divisor >1 of 1" My bad, 1 will not be in the input. Edited. | |
| Jul 3, 2020 at 9:26 | comment | added | Jakube | Also, what do you mean with smallest way? Do you mean the smallest number of subarrays in the decomposition? | |
| Jul 3, 2020 at 9:24 | comment | added | Jakube | How does the first subarray satisfy the condition? There is no divisor $> 1$ of $1$. | |
| Jul 3, 2020 at 6:16 | review | First posts | |||
| Jul 4, 2020 at 5:11 | |||||
| Jul 3, 2020 at 6:14 | history | asked | Dave | CC BY-SA 4.0 |