WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.

The paragraph with the most positive numbers v1

Threads: VCT inputs an array of n integers. Output the sub-segment with the most positive integers.
Input: Gồm số nguyên dương n và n số nguyên
Output: Current 1 is the number of positive numbers, current 2 is the subsegment with the most positive integers, nếu có nhiều đoạn thì chỉ xuất đoạn đầu tiên.

For example:
Input
12
3 2 -6 8 5 6 -9 4 5 6 -8 3
Output: 
3
8 5 6
Youtube: Thầy Thọ C2

You are not logged in? Log in to Submit Now!

Add a Comment