Correction to the example explanation: For the first dataset, one optimal solution is to partition the string into a subsequence of the 1st and 2nd characters and a subsequence of the 3rd and 4th characters, resulting in $01+01=10$.
QOJ.ac
QOJ
実行時間制限： 1 s
メモリ制限： 512 MB
満点： 100
#15882. Another 01 String Problem
統計
この問題は以下のコンテストで使用されています：
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.