Learn DSADSAContests
coding75 logo
LeetCode POTDPOTDSheets
coding75 Pro
coding75 logo
Dashboard
Learn DSA
Course RoadmapFlow
DSA Topic TreeNew πŸš€
Contest SolutionsPractice
Practice Sheets
MasterclassesLive πŸ‘¨πŸ»β€πŸ’»

coding75 ProPRO

Live Classes & Placement Guidance

coding75 logo

The premier developer platform for mastering Data Structures & Algorithms, exploring contest editorials, building ATS-ready resumes, and accelerating your tech career.

Connect & Community

DSA & Contests

  • Learn DSA
  • Contest Solutions
  • LeetCode POTDDaily
  • Practice Sheets
  • MasterclassesSoon

Interview Prep

  • Portfolio Projects
  • CS Fundamentals
  • System DesignSoon
  • Interview ExperiencesSoon
  • Mock InterviewsSoon

Career & Pro

  • Jobs & Internships
  • Resume BuilderATS
  • coding75 Pro
  • Submit Feedback
Β© 2026coding75β€’crackDSAβ„’β€’Maa Lalita Edtech Private Limited. All Rights Reserved.
Privacy PolicyTerms & ConditionsContact Support
Registered Office: Kanpur 208021β€’Regional Office: Indiranagar, Bangalore, 560008
Maa Lalita Edtech Private Limited
Contests/Codeforces/Codeforces Round 951/A. Guess the Maximum
Next
CodeforcesCodeforces
Newbie
Codeforces Round 951

A. Guess the Maximum

GreedyArrayMath
Loading...
Solve on Codeforces

Problem Statement

Official algorithmic problem description and constraints.

Open on Codeforces

Alice and Bob came up with a rather strange game. They have an array of integers π‘Ž1,π‘Ž2,…,π‘Žπ‘›. Alice chooses a certain integer π‘˜ and tells it to Bob, then the following happens:

  • Bob chooses two integers π‘– and π‘— (1≀𝑖<𝑗≀𝑛), and then finds the maximum among the integers π‘Žπ‘–,π‘Žπ‘–+1,…,π‘Žπ‘—;
  • If the obtained maximum is strictly greater than π‘˜, Alice wins, otherwise Bob wins.

Help Alice find the maximum π‘˜ at which she is guaranteed to win.

Solutions & Walkthrough

Detailed video explanations, mathematical intuition, and clean C++ implementation code.

Connecting secure classroom stream...
Back to Codeforces Round 951
Next Problem