{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003ch4 align\u003d\"center\"\u003e\n\tTime Limit: 1 second\u003c/h4\u003e\n\u003ch4 align\u003d\"center\"\u003e\n\tMemory Limit: 1 Mb\u003c/h4\u003e\n\u003cdiv\u003e\n\t\u0026nbsp;\u003c/div\u003e\n\u003cp\u003e\n\tGiven several arrays, find for each one the subarray with the maximum sum.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e\n\tThe input set consists of a positive number\u0026nbsp;\u003cb\u003eN \u0026le; 10000\u003c/b\u003e\u0026nbsp;, that gives the length of the array, followed by\u0026nbsp;\u003cb\u003eN\u003c/b\u003e\u0026nbsp;integers. Each integer is between \u003cb\u003e-1000\u003c/b\u003e and \u003cb\u003e1000\u003c/b\u003e.\u003c/p\u003e\n\u003cp\u003e\n\tThe input is terminated with\u0026nbsp;\u003cb\u003eN \u003d 0\u003c/b\u003e: your program should quit after this.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e\n\tFor each given input set, print one line to standard output. If the sum of the maximum subarray is positive, print \u003cpre\u003eThe maximum winning streak is S.\u003c/pre\u003e, where S is the sum of the subarray.\u003c/p\u003e\n\u003cp\u003e\nOtherwise, print \u003cpre\u003eLosing streak.\u003c/pre\u003e\n\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\n5\n12 -4 -10 4 9\n3\n-2 -1 -2\n0\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\nThe maximum winning streak is 13.\nLosing streak.\u003c/pre\u003e"}}]}