SHOW:
|
|
- or go back to the newest paste.
1 | import java.util.Arrays; | |
2 | import java.util.Scanner; | |
3 | // created by J.M. | |
4 | public class KaminoFactory { | |
5 | public static void main(String[] args) { | |
6 | Scanner scan = new Scanner(System.in); | |
7 | int length=Integer.parseInt(scan.nextLine()); | |
8 | String input=scan.nextLine(); | |
9 | int bestSequenceSum=0; int bestSequenceIndex=0; int count=0; int sequenceIndex=length; | |
10 | int[] dnaSequence=new int[length]; | |
11 | while (!input.equals("Clone them!")){ | |
12 | int [] arr = Arrays.stream(input.split("!+")).mapToInt(Integer::parseInt).toArray(); | |
13 | int sum=0; int index=length; count++; | |
14 | for(int i=0; i<arr.length; i++){ | |
15 | if((i!=arr.length-1)&&arr[i]==1&&arr[i+1]==1&&index==length){ | |
16 | index=i; | |
17 | } | |
18 | sum+=arr[i]; | |
19 | } | |
20 | if(index==sequenceIndex&&sum>bestSequenceSum){ | |
21 | dnaSequence = arr; bestSequenceIndex = count; bestSequenceSum = sum; sequenceIndex=index; | |
22 | }else if(index<sequenceIndex){ | |
23 | dnaSequence = arr; bestSequenceIndex = count; bestSequenceSum = sum; sequenceIndex=index; | |
24 | } | |
25 | input=scan.nextLine(); | |
26 | } | |
27 | if(bestSequenceSum==0){ | |
28 | bestSequenceIndex=1; | |
29 | } | |
30 | System.out.printf("Best DNA sample %d with sum: %d.%n", bestSequenceIndex,bestSequenceSum); | |
31 | for (int value : dnaSequence) { System.out.print(value + " "); | |
32 | } | |
33 | } | |
34 | } | |
35 |