// you can also use includes, for example:
// #include <algorithm>
int solution(vector<int> &A) {
// write your code in C++98
int count=0;
int n = A.size();
if(n<=1) return 0;
int num1=0;
int i, j;
for(i=n-1; i>=0; --i)
{
if(A[i] == 1)
{
num1++;
}
else
{
count += num1;
}
if(count > 1000000000) return -1;
}
return count;
}
01011
从右向左,每个0都要加上它左边1的个数。