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
53%
Correctness
100%
Performance
0%
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:
class Solution { public int solution(int[] 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 C#
Time spent on task 63 minutes
Notes
not defined yet
Code: 03:38:46 UTC,
java,
autosave
Code: 03:38:59 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
}
}
Code: 03:39:18 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
}
}
Code: 03:39:36 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
}
}
}
Code: 03:40:28 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
}
}
}
Code: 03:40:51 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
}
}
}
Code: 03:41:20 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i];
}
}
}
Code: 03:45:25 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i];
}
}
}
Code: 03:45:36 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i];
if(A[i])
}
}
}
Code: 03:46:14 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i];
if(A[i]+)
}
}
}
Code: 03:46:32 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i];
if(A[i]+i>=A.Length){
end=A.Length-1;
}
}
}
}
Code: 03:52:27 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
}
}
}
Code: 03:52:38 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+i;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
}
}
}
Code: 03:52:55 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
}
}
}
Code: 03:57:05 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
}
}
}
Code: 03:57:29 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
}
}
}
}
Code: 03:57:55 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<)
}
}
}
}
Code: 03:58:08 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+j)
}
}
}
}
Code: 03:58:19 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
}
}
}
}
}
Code: 04:00:25 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if
}
}
}
}
}
Code: 04:00:36 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length)
}
}
}
}
}
Code: 04:00:50 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
}
}
}
}
}
Code: 04:01:20 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if()
}
}
}
}
}
Code: 04:01:40 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if(A[i]-A[j])
}
}
}
}
}
Code: 04:01:56 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if(A[i]-A[j]<0){
break;
}
}
}
}
}
}
Code: 04:02:29 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if(A[i]A[j]<0){
break;
}
}
}
}
}
}
Code: 04:02:40 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int i=start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if(A[j]-A[i]<0){
break;
}
}
}
}
}
}
Code: 04:03:20 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int =start;i<A[i];i++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if(A[j]-A[i]<0){
break;
}
}
}
}
}
}
Code: 04:03:30 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int j=i;j<A[i]+i;j++){
if(i+j>=A.Length){
break;
}
if(A[j]-A[i]<0){
break;
}
}
}
}
}
}
Code: 04:03:47 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(i+j>=A.Length){
break;
}
if(A[j]-A[i]<0){
break;
}
}
}
}
}
}
Code: 04:04:01 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[j]<0){
break;
}
}
}
}
}
}
Code: 04:04:15 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}
}
}
}
}
}
Code: 04:04:48 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else
}
}
}
}
}
Code: 04:05:05 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
}
}
}
}
Code: 04:05:35 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i])
}
}
}
}
Code: 04:05:46 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
}
}
}
}
}
Code: 04:06:10 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}
}
}
}
}
Code: 04:06:57 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}
}
}
}
}
Code: 04:07:09 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}
}
}
return max;
}
}
Code: 04:07:19 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
return max;
}
}
Code: 04:07:40 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
return max;
}
}
Analysis
Code: 04:23:05 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
return max;
}
}
Code: 04:23:15 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
return max;
}
}
Code: 04:23:45 UTC,
cs,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<i;)
}
return max;
}
}
Code: 04:23:55 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<i;j++){
}
}
return max;
}
}
Code: 04:24:33 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<;j++){
}
}
return max;
}
}
Code: 04:24:44 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<A.Length;j++){
}
}
return max;
}
}
Code: 04:26:55 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<A.Length;j++){
}
}
return max;
}
}
Code: 04:27:09 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<A.Length;j++){
for(int k=0;k<i;k++){
}
}
}
return max;
}
}
Code: 04:27:22 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<A.Length;j++){
for(int k=j;k<i;k++){
}
}
}
return max;
}
}
Code: 04:27:43 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(intj=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
}
}
}
return max;
}
}
Code: 04:27:59 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
}
}
}
return max;
}
}
Code: 04:32:15 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
}
}
}
return max;
}
}
Code: 04:32:35 UTC,
cs,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(A[k]-i)
}
}
}
return max;
}
}
Code: 04:32:47 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(A[k]-i>=0){
++c;
}
}
}
}
return max;
}
}
Code: 04:33:08 UTC,
cs,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(A[k]-i>=0){
++c;
}
}
if(c==i)
}
}
return max;
}
}
Code: 04:33:27 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(A[k]-i>=0){
++c;
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Code: 04:33:57 UTC,
cs,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
i
if(A[k]-i>=0){
++c;
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Code: 04:34:09 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
}
if(A[k]-i>=0){
++c;
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Code: 04:34:19 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Code: 04:34:32 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Code: 04:34:35 UTC,
cs,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Analysis
Code: 04:34:50 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}
}
}
return max;
}
}
Code: 04:40:13 UTC,
cs,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}e
}
}
return max;
}
}
Code: 04:40:24 UTC,
cs,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}else{
c=0;
}
}
}
return max;
}
}
Code: 04:40:28 UTC,
cs,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}else{
c=0;
}
}
}
return max;
}
}
Analysis
Code: 04:41:17 UTC,
cs,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}else{
c=0;
}
}
}
return max;
}
}
Analysis
Code: 04:41:20 UTC,
cs,
final,
score:
53
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int count=0;
int max=0;
for(int i=0;i<A.Length;i++){
int start=i-A[i]+1;
if(start<0){
start=0;
}
int end=A[i]+start;
if(A[i]+i>=A.Length){
end=A.Length-1;
}
for(int j=start;j<A[i];j++){
for(int k=j;k<A[j]+j;k++){
if(j+k>=A.Length){
break;
}
if(A[k]-A[i]<0){
break;
}else{
count++;
}
}
if(count==A[i]){
if(count>max){
max=count;
}
}else{
count=0;
}
}
}
int c=0;
for(int i=0;i<A.Length;i++){
for(int j=0;j<A.Length;j++){
for(int k=j;k<i+j;k++){
if(k<A.Length){
if(A[k]-i>=0){
++c;
}
}
}
if(c==i){
if(i>max){
max=i;
}
}else{
c=0;
}
}
}
return max;
}
}
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N ** 3) or O(N ** 5) or O(N ** 2 * log(N)) or O(N ** 4) or O(N ** 2)
expand all
Correctness tests
1.
0.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 s
OK
5.
0.020 s
OK
6.
0.020 s
OK
7.
0.020 s
OK
8.
0.020 s
OK
1.
0.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 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.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 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.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 s
OK
5.
0.020 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.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 s
OK
5.
0.020 s
OK
6.
0.020 s
OK
7.
0.020 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.020 s
OK
2.
0.020 s
OK
3.
0.020 s
OK
4.
0.020 s
OK
5.
0.020 s
OK
6.
0.020 s
OK
7.
0.020 s
OK
1.
0.020 s
OK
2.
0.020 s
OK
expand all
Performance tests
big_monotonic_sequences
Various combinations of monotonic and constant sequences. N <= 750.
Various combinations of monotonic and constant sequences. N <= 750.
✘
TIMEOUT ERROR
running time: 0.492 sec., time limit: 0.100 sec.
running time: 0.492 sec., time limit: 0.100 sec.
1.
0.492 s
TIMEOUT ERROR,
running time: 0.492 sec., time limit: 0.100 sec.
2.
0.496 s
TIMEOUT ERROR,
running time: 0.496 sec., time limit: 0.100 sec.
3.
0.536 s
TIMEOUT ERROR,
running time: 0.536 sec., time limit: 0.100 sec.
4.
0.628 s
TIMEOUT ERROR,
running time: 0.628 sec., time limit: 0.100 sec.
5.
0.504 s
TIMEOUT ERROR,
running time: 0.504 sec., time limit: 0.100 sec.
6.
0.500 s
TIMEOUT ERROR,
running time: 0.500 sec., time limit: 0.100 sec.
big_random
Randomly generated tests. N <= 10,000. Score x 2.
Randomly generated tests. N <= 10,000. Score x 2.
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
4.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
4.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
5.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
6.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
7.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
8.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
9.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
10.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
11.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
12.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
13.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.