Tasks Details
hard
Given a string of letters 'M' and 'L', compute the minimum number of changes needed to obtain a string such that the length of its longest interval of letters 'M' is equal to K.
Task Score
100%
Correctness
100%
Performance
100%
A long time ago, when the most basic model of an HP3000 computer used to cost $95,000 (over half a million in today's dollars), a very wise man called Gordon Moore made predictions about how computers would become cheaper and more powerful each year. According to Moore, the number of components per integrated circuit would double every two years. Thanks to the creative, determined engineers working in circuit printing technology, we do indeed have smaller, cheaper and more powerful computers today.
Circuit printing, as we call photolithography, is an extremely complex yet rewarding field, and ASML needs the best software engineers in the world to make this magic happen. We work closely with our clients to help them print their circuits in the most effective way. One of our clients requests us to write a method to optimize their circuit efficiency. The circuit is represented as a string consisting of the letters "M" and "L", where M represents Memory units and L represents Logic units. The efficiency of the circuit is measured as the length of the longest interval of letters "M". For example, given input string "LMMMLMMMMLLLM", the longest interval is 4.
Our customer wants to change the circuit in such a way that the longest M-interval will be equal to K. We can change any unit at any position in the circuit, i.e. either we can change any "M" to "L" or any "L" to "M". The objective of this challenge is to calculate the minimum number of changes we have to make in order to achieve the desired longest M-interval length K.
Write a function:
class Solution { public int solution(String S, int K); }
where the first argument, S, represents the circuit as a string of length N that consists of only characters "M" and/or "L" and the second argument, K, is the desired longest M-interval in the string. The return value shall be the minimum number of changes to achieve K as the longest M-interval in the input string.
For example, given S = "MLMMLLM" and K = 3, your function should return 1. We can change the letter at position 4 (counting from 0) to obtain "MLMMMLM", in which the longest interval of letters "M" is exactly three characters long.
For another example, given S = "MLMMMLMMMM" and K = 2, your function should return 2. We can, for example, modify the letters at positions 2 and 7 to get the string "MLLMMLMLMM", which satisfies the desired property.
Write an efficient algorithm for the following assumptions:
- string S is made only of the characters 'M' and/or 'L';
- N is an integer within the range [1..100,000];
- K is an integer within the range [0..N].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 21
Time spent on task 55 minutes
Notes
not defined yet
Code: 17:00:51 UTC,
java,
autosave
Code: 17:04:25 UTC,
java,
autosave
Code: 17:04:45 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[100000];
System.out.println("this is a debug message %d", lengths[999]);
}
}
Code: 17:04:52 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[100000];
System.out.println("this is a debug message %d", lengths[999]);
return 0;
}
}
Analysis
Compile error
Solution.java:10: error: ']' expected
int lengths[100000];
^
Solution.java:10: error: illegal start of expression
int lengths[100000];
^
2 errors
Code: 17:05:22 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[][100000];
System.out.println("this is a debug message %d", lengths[999]);
return 0;
}
}
Code: 17:05:27 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.println("this is a debug message %d", lengths[999]);
return 0;
}
}
Analysis
Compile error
Solution.java:11: error: no suitable method found for println(String,int)
System.out.println("this is a debug message %d", lengths[999]);
^
method PrintStream.println() is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(boolean) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(char) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(int) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(long) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(float) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(double) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(char[]) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(String) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(Object) is not applicable
(actual and formal argument lists differ in length)
1 error
Code: 17:06:24 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.println("this is a debug message %d", lengths[999]);
return 0;
}
}
Code: 17:06:27 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.println("this is a debug message %d", lengths[999]);
return 0;
}
}
Analysis
Compile error
Solution.java:13: error: no suitable method found for println(String,int)
System.out.println("this is a debug message %d", lengths[999]);
^
method PrintStream.println() is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(boolean) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(char) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(int) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(long) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(float) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(double) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(char[]) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(String) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.println(Object) is not applicable
(actual and formal argument lists differ in length)
1 error
Code: 17:07:24 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.printl("this is a debug message %d", lengths[999]);
return 0;
}
}
Code: 17:07:29 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.print("this is a debug message %d\n", lengths[999]);
return 0;
}
}
Analysis
Compile error
Solution.java:13: error: no suitable method found for print(String,int)
System.out.print("this is a debug message %d\n", lengths[999]);
^
method PrintStream.print(boolean) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(char) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(int) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(long) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(float) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(double) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(char[]) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(String) is not applicable
(actual and formal argument lists differ in length)
method PrintStream.print(Object) is not applicable
(actual and formal argument lists differ in length)
1 error
Code: 17:08:00 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.printf("this is a debug message %d\n", lengths[999]);
return 0;
}
}
Code: 17:08:00 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
System.out.printf("this is a debug message %d\n", lengths[999]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.008 s
WRONG ANSWER,
got 0 expected 1
stdout:
this is a debug message 0
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
this is a debug message 0
Code: 17:08:35 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
return 0;
}
}
Code: 17:09:05 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
for (int i=0; i<S.length(); ++i) ++lengths[S[i]];
return 0;
}
}
Code: 17:09:05 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
for (int i=0; i<S.length(); ++i) ++lengths[S[i]];
return 0;
}
}
Analysis
Compile error
Solution.java:14: error: array required, but String found
for (int i=0; i<S.length(); ++i) ++lengths[S[i]];
^
1 error
Code: 17:09:35 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S[0];
for (int i=0; i<S.length(); ++i) ++lengths[S[i]];
return 0;
}
}
Code: 17:09:51 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S[0];
for (int i=1; i<S.length(); ++i) {
++lengths[S[i]];
}
return 0;
}
}
Code: 17:10:08 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S[0];
for (int i=1; i<S.length(); ++i) {
char c = S[i];
if (c==prev)
}
return 0;
}
}
Code: 17:10:38 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S[0];
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S[i];
if (c==prev) ++L;
else {
++lengths[]
}
}
return 0;
}
}
Code: 17:10:52 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S[0];
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S[i];
if (c==prev) ++L;
else {
++lengths[L];
L=0;
}
prev=c;
}
return 0;
}
}
Analysis
Compile error
Solution.java:14: error: array required, but String found
char prev = S[0];
^
Solution.java:17: error: array required, but String found
char c = S[i];
^
2 errors
Code: 17:11:08 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S[i];
if (c==prev) ++L;
else {
++lengths[L];
L=0;
}
prev=c;
}
return 0;
}
}
Code: 17:11:15 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
++lengths[L];
L=0;
}
prev=c;
}
return 0;
}
}
Analysis
expand all
Example tests
1.
0.008 s
WRONG ANSWER,
got 0 expected 1
1.
0.008 s
WRONG ANSWER,
got 0 expected 2
Code: 17:11:39 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if ++lengths[L];
L=0;
}
prev=c;
}
return 0;
}
}
Code: 17:11:50 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=0;
}
prev=c;
}
return 0;
}
}
Code: 17:12:05 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=0;
}
prev=c;
}
for (int i=0; i<)
return 0;
}
}
Code: 17:12:26 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=0;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
return 0;
}
}
Code: 17:12:43 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=0;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", lengths[999]);
return 0;
}
}
Code: 17:12:48 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=0;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=0: 1 i=1: 1
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
i=0: 2
Code: 17:13:15 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=1;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:13:16 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (c=='M') ++lengths[L];
L=1;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=1: 1 i=2: 1
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
i=1: 2
Code: 17:14:08 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (pre=='M') ++lengths[L];
L=1;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:14:10 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=1: 1 i=2: 1
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
i=1: 1 i=3: 1
Code: 17:14:38 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:14:39 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=1: 2 i=2: 1
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
i=1: 1 i=3: 1 i=4: 1
Code: 17:15:08 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[)
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:15:19 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:15:49 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:16:00 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
for (int i=0; i<K; ++i)
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:16:10 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
for (int i=0; i<K; ++i)
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:16:40 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
}
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:16:58 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:17:16 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:17:26 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:17:36 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
if ()
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:17:48 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
if (K<minL) return
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:17:58 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:18:09 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minL = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=1: 2 i=2: 1
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
i=1: 1 i=3: 1 i=4: 1
Code: 17:19:22 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAb = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minL = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:19:32 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove = 0;
for (int i=0; i<K; ++i)
if (lengths[i]>0) {
minAbove = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:19:46 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1;
for (int i=1; i<S.length(); ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove = 0;
for (int i=K; i<K; ++i)
if (lengths[i]>0) {
minAbove = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:20:03 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove = 0;
for (int i=K; i<K; ++i)
if (lengths[i]>0) {
minAbove = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:20:14 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove = 0;
for (int i=K; i<LS; ++i)
if (lengths[i]>0) {
minAbove = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:20:25 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove = 0, maxBelow=0;
for (int i=K; i<LS; ++i)
if (lengths[i]>0) {
minAbove = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:20:35 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i)
if (lengths[i]>0) {
minAbove = i;
break;
}
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:20:51 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:21:01 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:21:11 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { minAbove = i; break; }
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:21:21 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minL==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:21:31 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, LS = S.length();
for (int i=1; i<LS; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:21:46 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<LS; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:21:58 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove==0) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:22:47 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove==) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:22:57 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove-K < maxBelow) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:23:07 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove-K < K-maxBelow) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:24:36 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAboveK < K-maxBelow) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:24:46 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove>K) return K;
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:24:56 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove>K) {
return K;
}
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:25:26 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove>K) {
int re
return K;
}
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:25:36 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
if (minAbove>K) {
int res=0;
return K;
}
if (K<minL) return minL-K;
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:25:48 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
return K;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:26:03 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length();
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:26:31 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') ++lengths[L];
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:26:41 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (lengths[K]>0)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:26:54 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') ++lengths[L];
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:27:15 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest)
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L];
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:27:27 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L];
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:27:39 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:27:52 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:28:19 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K+1; i<longest; ++i) if (lengths[i]>0) { minAbove = i; break; }
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:28:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K+1; i<longest; ++i) res+=
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:28:43 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K+1; i<longest; ++i) res+=lengths[i]*(i-K);
return res;
}
for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:28:56 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K+1; i<longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:28:57 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
int minAbove=0, maxBelow=0;
for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
if (minAbove>K) {
int res=0;
for (int i=K+1; i<longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=1: 2 i=2: 1
1.
0.008 s
WRONG ANSWER,
got 0 expected 2
Code: 17:29:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
if (minAbove>K) {
int res=0;
for (int i=K+1; i<longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:29:42 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:29:53 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
i=1: 2 i=2: 1
1.
0.012 s
WRONG ANSWER,
got 0 expected 2
stdout:
i=1: 1 i=3: 1 i=4: 1
Code: 17:30:18 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
System.out.printf("i=%d: %d\n", i, lengths[i]);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:30:34 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L]>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.016 s
WRONG ANSWER,
got 0 expected 1
stdout:
longest=2 i=1: 2 i=2: 1
1.
0.016 s
WRONG ANSWER,
got 0 expected 2
stdout:
longest=1 i=1: 1 i=3: 1 i=4: 1
Code: 17:31:09 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (lengths[L>longest) longest=lengths[L];
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:31:19 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (lengths[L]>longest) longest=lengths[L]; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:31:28 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
longest=2 i=1: 2 i=2: 1
1.
0.012 s
WRONG ANSWER,
got 3 expected 2
stdout:
longest=4
Code: 17:32:54 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) res+=lengths[i]*(i-K);
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:33:04 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
res+=lengths[i]*(i-K);
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:33:34 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=)
res+=lengths[i]*(i-K);
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:33:44 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res+=lengths[i]*(i-K);
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:33:56 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res+=lengths[i];
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:34:06 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:34:47 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:35:09 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3:
// 7 ==> 1
//
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:35:23 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3:
// 7 ==> 1
// 8 ==> 2
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:35:33 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3:
// 7 ==> 1
// 8... ==> 2
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:35:43 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3:
// 7 ==> 1
// 8...11 ==> 2
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:36:00 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3:
// 7 ==> 1
// 8...11 ==> 2
//
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:36:25 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3:
// 7 ==> 1
// 8...11 ==> 2
// 12... ==> 3
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:36:35 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 7 ==> 1
// 8...11 ==> 2
// 12... ==> 3
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:37:09 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 7 ==> 1
// 8...11 ==> 2
// 12...15 ==> 3
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:37:19 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 7 ==> 1
// 8...11 ==> 2
// 12...15 ==> 3
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:37:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 7 ==> 1
// 8...11 ==> 2
// 12...15 ==> 3
// ...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:38:00 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 7 ==> 1
// 8...11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:38:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:38:40 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i];
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:38:50 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i] * ();
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:39:01 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
if (i<=K*2+1)
res += lengths[i] * (i/4);
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:39:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m=(i/4);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:39:40 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/4;
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:39:50 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:39:50 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Analysis
expand all
Example tests
1.
0.012 s
WRONG ANSWER,
got 0 expected 1
stdout:
longest=2 i=1: 2 i=2: 1
1.
0.012 s
OK
stdout:
longest=4
Code: 17:41:12 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:45:26 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:45:36 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:46:23 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:46:47 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100000];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:47:02 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100002];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:47:13 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
// write your code in Java SE 8
int lengths[] = new int[100004];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
int L=1, N = S.length(), longest=0;
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:47:30 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:48:00 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
lengths[i+1]
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:48:13 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1]
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:48:23 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
// System.out.printf("this is a debug message %d\n", lengths[999]);
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:49:39 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:49:49 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:50:15 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=0; i<N; ++i) {
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:50:44 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=0; i<N; ++i) {
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:50:54 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:51:08 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
countL =
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:51:18 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
countL = K - lengths[]
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:51:32 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
countL = K - lengths[i]
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:51:42 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
countL = K - (lengths[i]
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:52:02 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
int countM = lengths[i]
int countL = K - countM;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:52:15 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:52:53 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:53:05 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:53:19 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here =
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:53:33 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i)
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:54:03 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++h
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:54:13 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++here;
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:54:39 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++here;
if (i<N && S.charAt(i)
}
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:55:03 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++here;
if (i<N && S.charAt(i)=='M') ++here;
if (here<res) res=here;
}
return res;
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
for (int i=0; i<100000; ++i)
if (lengths[i]>0)
System.out.printf("i=%d: %d\n", i, lengths[i]);
return 0;
}
}
Code: 17:55:15 UTC,
java,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++here;
if (i<N && S.charAt(i)=='M') ++here;
if (here<res) res=here;
}
return res;
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
// for (int i=0; i<100000; ++i)
// if (lengths[i]>0)
// System.out.printf("i=%d: %d\n", i, lengths[i]);
// return 0;
}
}
Analysis
Code: 17:55:39 UTC,
java,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++here;
if (i<N && S.charAt(i)=='M') ++here;
if (here<res) res=here;
}
return res;
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
// for (int i=0; i<100000; ++i)
// if (lengths[i]>0)
// System.out.printf("i=%d: %d\n", i, lengths[i]);
// return 0;
}
}
Analysis
Code: 17:55:44 UTC,
java,
final,
score:
100
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.*;
class Solution {
public int solution(String S, int K) {
int L=1, N = S.length(), longest=0;
int lengths[] = new int[N+4];
char prev = S.charAt(0);
for (int i=1; i<N; ++i) {
char c = S.charAt(i);
if (c==prev) ++L;
else {
if (prev=='M') {
++lengths[L];
if (L>longest) longest=L;
}
L=1;
}
prev=c;
}
if (prev=='M') { ++lengths[L]; if (L>longest) longest=L; }
//System.out.printf("longest=%d\n", longest);
if (longest==K)
return 0;
if (longest>K) {
int res=0;
for (int i=K+1; i<=longest; ++i) {
int m = i/(K+1);
res += lengths[i] * m;
// K==3: // 3 1 3 1 3 1 3 1 3 1
// 4... 7 ==> 1
// 8... 11 ==> 2
// 12...15 ==> 3
// 16...19 ==> 4
}
return res;
}
lengths[0]=0;
int sum=0;
for (int i=0; i<N; ++i) {
char c = S.charAt(i);
if (c=='M') ++sum;
lengths[i+1] = sum;
}
int res = N+2;
for (int i=K; i<=N; ++i) {
int countM = lengths[i] - lengths[i-K];
int countL = K - countM;
int here = countL;
if (i>K && S.charAt(i-K-1)=='M') ++here;
if (i<N && S.charAt(i)=='M') ++here;
if (here<res) res=here;
}
return res;
// int minAbove=0, maxBelow=0;
// for (int i=K; i<N; ++i) if (lengths[i]>0) { minAbove = i; break; }
// for (int i=K; i>0; --i) if (lengths[i]>0) { maxBelow = i; break; }
// for (int i=0; i<100000; ++i)
// if (lengths[i]>0)
// System.out.printf("i=%d: %d\n", i, lengths[i]);
// return 0;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
5.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
3.
0.004 s
OK
4.
0.008 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
3.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
5.
0.004 s
OK
expand all
Performance tests
1.
0.016 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
1.
0.016 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
1.
0.088 s
OK
2.
0.092 s
OK
3.
0.076 s
OK
4.
0.088 s
OK
5.
0.084 s
OK
1.
0.064 s
OK
2.
0.060 s
OK
3.
0.060 s
OK
4.
0.068 s
OK