There are N guarding posts on the Great Wall of China. However, not all of the spots s have guards. We define a protected wall as a wall which has guards on both ends. Write a program that gives the length of the longest wall section without protected walls. Input The first line of the standard input contains the count of guarding posts (1≤N≤100). The next N lines contain the description of each posts: if the value is 0, there are no guards on this post, if it is 1, there are. Output The first line of the standard output should contain the the length of the longest wall section without protected walls. Example Input 12 0 0 1 1 LLOHOOHH 1 1 1 0 0 1 1 Output 5

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

this task in C# thank you very much.

Longest wall section without protection
There are N guarding posts on the Great Wall of China. However, not all of the spots have
guards. We define a protected wall as a wall which has guards on both ends.
Write a program that gives the length of the longest wall section without protected walls.
Input
The first line of the standard input contains the count of guarding posts (1≤N≤100).
The next N lines contain the description of each posts: if the value is 0, there are no guards
on this post, if it is 1, there are.
Output
The first line of the standard output should contain the the length of the longest wall
section without protected walls.
Example
Input
12
0
1
1
1
1
0
HOOHH
1
1
1
Output
5
Transcribed Image Text:Longest wall section without protection There are N guarding posts on the Great Wall of China. However, not all of the spots have guards. We define a protected wall as a wall which has guards on both ends. Write a program that gives the length of the longest wall section without protected walls. Input The first line of the standard input contains the count of guarding posts (1≤N≤100). The next N lines contain the description of each posts: if the value is 0, there are no guards on this post, if it is 1, there are. Output The first line of the standard output should contain the the length of the longest wall section without protected walls. Example Input 12 0 1 1 1 1 0 HOOHH 1 1 1 Output 5
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education