Cost Maximization

You are given a binary string of length $N$. You can remove a substring `01` to gain $C_{0}$ coins and a substring `10` to gain $C_{1}$ coins. After removing a substring, the remaining two strings will be concatenated to form the new string. For example in string `11011` after removing `10` from the string the two parts will be `1` and `11`. Now the string will become `111`. What is the maximum