#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue> //CF div2(225) C
#define LL long long
#define N 200100
#define inf 999999999
using namespace std;
int a[N];
int main()
{
int n, t;
LL k, s;
while(scanf("%d", &n)!=EOF)
{
for(t=1; t<=n; ++t)
scanf("%d", a+t);
for(t=n, s=k=0; t>0; --t)
{
if(!a[t])
k++;
else s+=k;
}
printf("%I64d\n", s);
}
return 0;
}
CF div2(225) C
最新推荐文章于 2022-03-05 12:43:47 发布