摘要：B. Balanced Substring You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string slsl + 1sl + 2... sr, and it 阅读全文

摘要：C - Splitting Pile Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement Snuke and Raccoon have a heap of N cards. The i-th ca 阅读全文