{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n \u003cp\u003eGiven an array a of N integers a1, a2, a3, ... aN you have to find the longest crazy sequence in this array.\u003c/p\u003e\n \u003cp\u003eA sequence a1, a2 ... ak, k\u0026gt;\u003d1 is considered crazy if it has 2 properties:\u003c/p\u003e\n \u003cul\u003e\n \u003cli\u003eThe absolute for all items in sub-sequence is in increasing order ie: |a1| \u0026lt; |a2| \u0026lt; |a3| \u0026lt; ... \u0026lt; |ak|\u003c/li\u003e\n \u003cli\u003eThe signs between adjacent elements are different, i.e., if a1 \u0026gt; 0 then a2 \u0026lt; 0, a3 \u0026gt; 0 and so on. Alternatively, if a1 \u0026lt; 0, then a2 \u0026gt; 0, a3 \u0026lt; 0 and so on.\u003c/li\u003e\n \u003c/ul\u003e\n \u003cp\u003eNote that sub-sequence of array a is a sequence obtained by removing some elements of the array a.\u003c/p\u003e\n \u003cp\u003eIt is guaranteed that the array a doesn\u0027t contain 0.\u003c/p\u003e\n \u003ch3\u003eConstraints\u003c/h3\u003e\n \u003cp\u003e1 \u0026lt;\u003d N \u0026lt;\u003d 5000\u003cbr\u003e\n |ai| \u0026lt;\u003d 10^9, ai not equal to 0.\u003c/p\u003e\n \u003ch3\u003eInput\u003c/h3\u003e\n \u003cp\u003eThe first line contains a single integer N, denoting the size of the array. The next line contains N integers, denoting the array a.\u003c/p\u003e\n \u003ch3\u003eOutput\u003c/h3\u003e\n \u003cp\u003ePrint a single integer - the length of the longest alternating sub-sequence.\u003c/p\u003e\n \u003ch3\u003eExample\u003c/h3\u003e\n \u003cpre\u003e\n\u003cb\u003eInput:\u003c/b\u003e\n8\n1 2 -2 -3 5 -7 -8 10\n\n\u003cb\u003eOutput:\u003c/b\u003e\n5\n\u003c/pre\u003e\n \u003ch3\u003eExplanation\u003c/h3\u003e\n \u003cp\u003eOne of the longest alternating subsequence is\u003c/p\u003e\n \u003cpre\u003e 1 -2 5 -7 10 \u003cbr\u003e(so here the sign is alternating between the elements and they are in increasing order if you took absolute for all of them)\u003c/pre\u003e\n\n\u003c/div\u003e"}}]}