Tasks Details
medium
Find the side length of the biggest black square in a matrix. In each column, black cells start at the bottom of the matrix and count up.
Task Score
76%
Correctness
100%
Performance
50%
You are given an N × N matrix in which every cell is colored black or white. Columns are numbered from 0 to N-1 (from left to right). This coloring is represented by a non-empty array of integers A. If the K-th number in the array is equal to X then the X lowest cells in the K-th column of the matrix are black. The rest of the cells in the K-th column are white. The task is to calculate the side length of the biggest black square (a square containing only black cells).
Write a function:
function solution(A);
that, given an array of integers A of length N representing the coloring of the matrix, returns the side length of the biggest black square.
Examples:
1. Given A = [1, 2, 5, 3, 1, 3], the function should return 2. For example, the black square of side 2 contains the two lowest rows of the 1st and 2nd columns (counting from 0).
![The picture describes the first example test [1, 2, 5, 3, 1, 3].](https://codility-frontend-prod.s3.amazonaws.com/media/task_static/max_square_on_matrix/static/images/auto/a239141bf78ea877bfd84d5b6c5d27eb.png)
2. Given A = [3, 3, 3, 5, 4], the function should return 3. For example, the biggest black square has side 3 and contains the three lowest rows of the last three columns.
![The picture describes the second example test [3, 3, 3, 5, 4].](https://codility-frontend-prod.s3.amazonaws.com/media/task_static/max_square_on_matrix/static/images/auto/f93c01c901739dfbca08e866359484f2.png)
3. Given A = [6, 5, 5, 6, 2, 2], the function should return 4. The biggest black square has side 4 and contains the four lowest rows of the first four columns.
![The picture describes the third example test [6, 5, 5, 6, 2, 2].](https://codility-frontend-prod.s3.amazonaws.com/media/task_static/max_square_on_matrix/static/images/auto/149f2bd0051e4c8106205b1ab023e4d5.png)
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [1..N].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 38 minutes
Notes
not defined yet
Code: 19:28:59 UTC,
java,
autosave
Code: 19:29:22 UTC,
java,
autosave
Code: 19:30:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:30:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:31:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:31:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar<
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:31:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<){
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:31:41 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
}else if(){
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:31:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<A[i]){
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:32:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<f+b){
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:32:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<f+b){
ar=A[i]
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:33:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<f+b){
ar=A[i]
}
}
//console.log(ar)
return ar
}
Code: 19:33:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<f+b){
ar=f+b
}
}
//console.log(ar)
return ar
}
Code: 19:36:59 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<f+b){
ar=f+b
}
}
//console.log(ar)
return ar
}
Analysis
Code: 19:37:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=0;
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]&&ar<A[i]){
ar=A[i]
}else if(ar<f+b){
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:37:33 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Analysis
Code: 19:38:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Code: 19:38:07 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
//console.log(ar)
return Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=4A[i]=1-1-f1 i=5A[i]=3-3-f1
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=5A[i]=2-2-f1
Code: 19:38:28 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; b> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=4A[i]=1-1-f1 i=5A[i]=3-3-f1 [ 1, 2, 2, 2, 1, 1 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 [ 3, 3, 3, 2, 1 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=5A[i]=2-2-f1 [ 2, 4, 4, 2, 2, 1 ]
Code: 19:39:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
Code: 19:39:33 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:40:02 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
&&let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
Code: 19:40:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
Code: 19:40:41 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
Code: 19:40:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
ar.push(f+b)
if(A[i]>m){
m=A[i]
}
}
}
console.log(ar)
return Math.max( ...ar )
}
Code: 19:41:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
console.log(ar)
return Math.max( ...ar )
}
Code: 19:41:15 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
console.log(m)
return Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.120 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: ar is not defined
at solution (solution.js:24:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
i=0A[i]=1-1-f1
1.
0.120 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: ar is not defined
at solution (solution.js:24:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3
1.
0.120 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: ar is not defined
at solution (solution.js:29:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2
Code: 19:41:31 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
console.log(m)
return m// Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: ar is not defined
at solution (solution.js:24:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
i=0A[i]=1-1-f1
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: ar is not defined
at solution (solution.js:24:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: ar is not defined
at solution (solution.js:29:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2
Code: 19:42:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
console.log(m)
return m// Math.max( ...ar )
}
Code: 19:42:06 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
console.log(m)
return m// Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 3
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 3
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 4
Code: 19:42:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
Code: 19:42:27 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
// console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
Analysis
Code: 19:42:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
Code: 19:42:51 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2
Code: 19:43:12 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
Code: 19:43:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
//let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:44:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:44:51 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:46:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:46:58 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=0A[i]=1-2-f2 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-3-f3 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-3-f2 i=4A[i]=1-1-b1 i=4A[i]=1-3-b2 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 i=5A[i]=3-5-b3 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=0A[i]=3-5-f4 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-4-f4 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=4A[i]=2-5-b3 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 i=5A[i]=2-6-b3 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:50:35 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i+1 ; bi>= i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:50:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i+1;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i+1 ; bi>= i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:50:48 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i+1;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i+1 ; bi>= i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-2-f1 i=0A[i]=1-2-b1 i=1A[i]=2-5-f1 i=1A[i]=2-3-f2 i=1A[i]=2-5-b1 i=1A[i]=2-2-b2 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-3-f1 i=4A[i]=1-3-b1 i=4A[i]=1-1-b2 i=4A[i]=1-3-b3 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 i=5A[i]=3-5-b3 [ 1, 2, 1, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-5-f3 i=0A[i]=3-3-b1 i=1A[i]=3-3-f1 i=1A[i]=3-5-f2 i=1A[i]=3-4-f3 i=1A[i]=3-3-b1 i=1A[i]=3-3-b2 i=2A[i]=3-5-f1 i=2A[i]=3-4-f2 i=2A[i]=3-5-b1 i=2A[i]=3-3-b2 i=2A[i]=3-3-b3 i=3A[i]=5-5-b1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 1, 2 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=1A[i]=5-5-f1 i=1A[i]=5-6-f2 i=1A[i]=5-5-b1 i=1A[i]=5-5-b2 i=2A[i]=5-6-f1 i=2A[i]=5-6-b1 i=2A[i]=5-5-b2 i=2A[i]=5-5-b3 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-b1 i=4A[i]=2-2-b2 i=4A[i]=2-6-b3 i=4A[i]=2-5-b4 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 i=5A[i]=2-6-b3 [ 1, 4, 4, 1, 2, 2 ]
Code: 19:51:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:51:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:51:52 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.072 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:52:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:53:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i]-1 &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:53:14 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i-1&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i]-1 &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.124 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=4A[i]=1-3-b2 i=4A[i]=1-5-b3 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 i=5A[i]=3-5-b3 [ 1, 2, 2, 3, 1, 3 ]
1.
0.128 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.128 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=4A[i]=2-5-b3 i=4A[i]=2-5-b4 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 i=5A[i]=2-6-b3 i=5A[i]=2-5-b4 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:53:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i-1&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i]1 &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:54:02 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i-1&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i]+1 &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:54:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<=A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi>= i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:54:44 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:56:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b-)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:56:50 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i]-1)
}else{
ar.push(f+b-1)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 0, 1, 1, 2, 0, 2 ]
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 2, 2, 2, 1, 2 ]
1.
0.076 s
WRONG ANSWER,
got 3 expected 4
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 1, 3, 3, 1, 1, 1 ]
Code: 19:57:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i]-)
}else{
ar.push(f+b-1)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:57:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:57:46 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 2, 4, 4, 2, 2, 2 ]
Code: 19:58:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f)
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:58:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 19:58:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i+;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:01:59 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi=>0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:02:06 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=0A[i]=1-1-b1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=1A[i]=2-2-b1 i=2A[i]=5-5-f1 i=2A[i]=5-5-b1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-3-b1 i=3A[i]=3-5-b2 i=4A[i]=1-1-f1 i=4A[i]=1-1-b1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 i=5A[i]=3-3-b2 [ 1, 2, 2, 3, 1, 3 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=0A[i]=3-3-b1 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=1A[i]=3-3-b2 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=2A[i]=3-3-b3 i=3A[i]=5-5-f1 i=3A[i]=5-5-b1 i=4A[i]=4-4-f1 i=4A[i]=4-4-b1 i=4A[i]=4-5-b2 [ 3, 3, 3, 2, 3 ]
1.
0.076 s
WRONG ANSWER,
got 5 expected 4
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=0A[i]=6-6-b1 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-5-b1 i=1A[i]=5-6-b2 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-5-b2 i=2A[i]=5-6-b3 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=3A[i]=6-6-b2 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-2-b1 i=4A[i]=2-6-b2 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 i=5A[i]=2-2-b2 [ 3, 5, 5, 3, 2, 2 ]
Code: 20:03:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:03:08 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 3 expected 2
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=2A[i]=5-5-f1 i=3A[i]=3-3-f1 i=3A[i]=3-3-f2 i=3A[i]=3-5-b1 i=4A[i]=1-1-f1 i=5A[i]=3-3-f1 i=5A[i]=3-3-b1 [ 1, 2, 1, 3, 1, 2 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=4A[i]=4-4-f1 i=4A[i]=4-5-b1 [ 3, 3, 3, 1, 2 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=0A[i]=6-6-f2 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-6-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-6-b2 i=3A[i]=6-6-f1 i=3A[i]=6-6-b1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-6-b1 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 [ 2, 4, 4, 2, 2, 2 ]
Code: 20:03:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}ls
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:04:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:04:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:04:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:04:48 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
ar.push(A[i])
}else{
ar.push(f+b)
}
}
console.log(ar)
return Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=2A[i]=5-5-f1 i=3A[i]=3-3-f1 i=3A[i]=3-5-b1 i=4A[i]=1-1-f1 i=5A[i]=3-3-f1 [ 1, 2, 1, 2, 1, 1 ]
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=4A[i]=4-4-f1 i=4A[i]=4-5-b1 [ 3, 3, 3, 1, 2 ]
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-6-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-6-b2 i=3A[i]=6-6-f1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-6-b1 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1 [ 1, 4, 4, 1, 2, 2 ]
Code: 20:05:33 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:05:52 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Code: 20:05:54 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
i=0A[i]=1-1-f1 i=1A[i]=2-2-f1 i=1A[i]=2-5-f2 i=2A[i]=5-5-f1 i=3A[i]=3-3-f1 i=3A[i]=3-5-b1 i=4A[i]=1-1-f1 i=5A[i]=3-3-f1
1.
0.076 s
OK
stdout:
i=0A[i]=3-3-f1 i=0A[i]=3-3-f2 i=0A[i]=3-3-f3 i=1A[i]=3-3-f1 i=1A[i]=3-3-f2 i=1A[i]=3-5-f3 i=1A[i]=3-3-b1 i=2A[i]=3-3-f1 i=2A[i]=3-5-f2 i=2A[i]=3-4-f3 i=2A[i]=3-3-b1 i=2A[i]=3-3-b2 i=3A[i]=5-5-f1 i=4A[i]=4-4-f1 i=4A[i]=4-5-b1
1.
0.076 s
OK
stdout:
i=0A[i]=6-6-f1 i=1A[i]=5-5-f1 i=1A[i]=5-5-f2 i=1A[i]=5-6-f3 i=1A[i]=5-6-b1 i=2A[i]=5-5-f1 i=2A[i]=5-6-f2 i=2A[i]=5-5-b1 i=2A[i]=5-6-b2 i=3A[i]=6-6-f1 i=4A[i]=2-2-f1 i=4A[i]=2-2-f2 i=4A[i]=2-6-b1 i=5A[i]=2-2-f1 i=5A[i]=2-2-b1
Code: 20:06:12 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
Code: 20:06:19 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis
Code: 20:06:21 UTC,
js,
final,
score:
76
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let ar=[]
let m=0
for(let i =0;i<A.length;i++){
let f=0;
let b=0;
for(let ki =i;ki<A[i]+i&&ki<A.length;ki++){
if(A[ki]>=A[i]){
f++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[ki]+"-f"+f)
}else{
break
}
}
for(let bi =i-1 ; bi> i-A[i] &&bi>=0;bi--){
if(A[bi]>=A[i]){
b++;
//console.log("i="+i+"A[i]="+A[i]+"-"+A[bi]+"-b"+b)
}else{
break
}
}
if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar )
}
/** if(f+b>=A[i]){
//ar.push(A[i])
if(A[i]>m){
m=A[i]
}
}else{
//ar.push(f+b)
if(f+b>m){
m=f+b
}
}
}
//console.log(m)
return m// Math.max( ...ar ) */
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N * log(N)) or O(N) or O(N ** 2) or O(N ** 2 * log(N))
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.068 s
OK
7.
0.072 s
OK
8.
0.068 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
small_sticking_out_square
Tests with the biggest square surrounded by shorter columns. N <= 10.
Tests with the biggest square surrounded by shorter columns. N <= 10.
✔
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
small_big_and_small_numbers
Tests with alternating small and big numbers (relatively). N <= 15.
Tests with alternating small and big numbers (relatively). N <= 15.
✔
OK
1.
0.072 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
medium_few_monotonic_sequences
Two monotonic sequences or one monotonic and one constant. N <= 75.
Two monotonic sequences or one monotonic and one constant. N <= 75.
✔
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
7.
0.072 s
OK
medium_local_maximums_and_local_minimums
Tests with local maximums and local minimums. N <= 75.
Tests with local maximums and local minimums. N <= 75.
✔
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
7.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
expand all
Performance tests
1.
0.076 s
OK
2.
0.076 s
OK
3.
0.076 s
OK
4.
0.076 s
OK
5.
0.080 s
OK
6.
0.076 s
OK
1.
0.084 s
OK
2.
0.076 s
OK
3.
0.084 s
OK
4.
0.116 s
OK
1.
0.100 s
OK
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
0.120 s
OK
4.
0.112 s
OK
5.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
6.
0.116 s
OK
7.
0.152 s
OK
8.
0.232 s
OK
9.
5.600 s
TIMEOUT ERROR,
running time: 5.600 sec., time limit: 0.464 sec.
10.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
11.
0.208 s
OK
12.
0.192 s
OK
13.
0.108 s
OK