-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSample.java
More file actions
83 lines (60 loc) · 1.81 KB
/
Sample.java
File metadata and controls
83 lines (60 loc) · 1.81 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
package test;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
public class Sample {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static int nextInt() throws IOException {
return Integer.parseInt(br.readLine());
}
public static int[] nextArr() throws IOException {
String elements[] = br.readLine().split(" ");
int arr[] = new int[elements.length];
for (int j = 0; j < elements.length; j++)
arr[j] = Integer.parseInt(elements[j]);
return arr;
}
public static void printArr(int arr[]) {
for (int i = 0; i < arr.length; i++)
System.out.print(arr);
}
public static String next() throws IOException {
return br.readLine();
}
public static String swap(String str, int i, int j) {
char ch[] = str.toCharArray();
char temp = ch[i];
ch[i] = ch[j];
ch[j] = temp;
return new String(ch);
}
public static void main(String[] args) throws IOException {
int T = nextInt();
while (T-- > 0) {
int n = nextInt();
int arr[] = nextArr();
ArrayList<Integer> res = new ArrayList<Integer>();
for (int i = 0; i < arr.length; i++)
res.add(arr[i]);
int max = Collections.max(res);
int findex = res.indexOf(max);
res.set(findex, Integer.MIN_VALUE);
int smax = Collections.max(res);
int sindex = res.indexOf(smax);
System.out.println(findex + " " + sindex);
int start = Math.min(findex, sindex);
int last = Math.max(findex, sindex);
int sum1 = 0, sum2 = 0;
for (int i = start; i <= last; i++)
sum1 += arr[i];
System.out.println(start + " " + last);
for (int i = last; i < n; i++)
sum2 += arr[i];
for (int i = 0; i <= start; i++)
sum2 += arr[i];
System.out.println(Math.max(sum1, sum2));
}
}
}