-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhps.java
More file actions
105 lines (93 loc) · 2.02 KB
/
hps.java
File metadata and controls
105 lines (93 loc) · 2.02 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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/*
ID: grifync1
LANG: JAVA
PROG: hps
*/
//lil lil peezy
import java.util.*;
import java.io.*;
public class hps {
public static int conv(String s) {
return Integer.parseInt(s);
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static void print(int num) {
System.out.println(num);
}
public static void prints(String s) {
System.out.println(s);
}
public static void printa(int[] a) {
for (int i = 0; i < a.length; i++) {
if (i == 0) {
System.out.print(a[i]);
} else {
System.out.print(" " + a[i]);
}
}
}
public static int[] sort(int[] nums) {
Arrays.sort(nums);
return nums;
}
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new FileReader("hps.in"));
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("hps.out")));
//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
//PrintWriter out = new PrintWriter(System.out);
///StringTokenizer st = new StringTokenizer(in.readLine());
int len = conv(in.readLine());
int[] h = new int[len];
int[] s = new int[len];
int[] p = new int[len];
char[] moves = new char[len];
for(int i=0; i<len; i++) {
String str = in.readLine();
moves[i]=str.charAt(0);
}
if(moves[0]=='P') {
p[0]=1;
}
else if(moves[0]=='S') {
s[0]=1;
}
else if(moves[0]=='H') {
h[0]=1;
}
for(int i=1; i<len; i++) {
s[i]=s[i-1];
h[i]=h[i-1];
p[i]=p[i-1];
if(moves[i]=='P') {
p[i]++;
}
else if(moves[i]=='S') {
s[i]++;
}
else if(moves[i]=='H') {
h[i]++;
}
}
int ans = -1;
for(int i=0; i<len; i++) {
if(i==0) {
int monx = max(p[len-1], max(s[len-1], h[len-1]));
ans = max(ans, monx);
continue;
}
else {
int mots = max(p[i], max(s[i], h[i]));
int monx = max(p[len-1]-p[i], max(s[len-1]-s[i], h[len-1]-h[i]));
ans = max(ans, mots+monx);
}
}
out.println( ans);
in.close();
out.close();
}
}