Codeforces Round #225 (Div. 2)-C. Milking cows
来源:互联网 发布:windows live mail pst 编辑:程序博客网 时间:2024/05/29 12:31
原题链接
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing to the right. When Iahub milks a cow, all the cows that see the current cow get scared and lose one unit of the quantity of milk that they can give. A cow facing left sees all the cows with lower indices than her index, and a cow facing right sees all the cows with higher indices than her index. A cow that got scared once can get scared again (and lose one more unit of milk). A cow that has been milked once cannot get scared and lose any more milk. You can assume that a cow never loses all the milk she can give (a cow gives an infinitely amount of milk).
Iahub can decide the order in which he milks the cows. But he must milk each cow exactly once. Iahub wants to lose as little milk as possible. Print the minimum amount of milk that is lost.
The first line contains an integer n (1 ≤ n ≤ 200000). The second line contains n integers a1, a2, ..., an, where ai is 0 if the cow number i is facing left, and 1 if it is facing right.
Print a single integer, the minimum amount of lost milk.
Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.
40 0 1 0
1
51 0 1 0 1
3
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <map>#include <vector>#include <queue>#include <cmath>#define maxn 1000005#define MOD 1000000007#define INF 1e9using namespace std;typedef long long ll;int main(){int n, a, t = 0;ll ans = 0;scanf("%d", &n);for(int i = 0; i < n; i++){scanf("%d", &a);t += a;if(a == 0) ans += t;}cout << ans << endl;return 0; }
- Codeforces Round #225 (Div. 2) C. Milking cows
- Codeforces Round #225 (Div. 2)-C. Milking cows
- Codeforces Round #174 (Div. 2)---C. Cows and Sequence(操作序列)
- 【codeforces】Codeforces Round #370 (Div. 2) C
- cf#225-C - Milking cows-贪心
- codeforces 384C Milking cows(脑洞+思维)
- Codeforces Round #225 (Div. 2)
- Codeforces 383 A. Milking cows
- Codeforces 383A Milking cows
- 【DP】Codeforces Round #139 (Div. 2)225 C Barcode
- Codeforces Round #105 (Div. 2) C
- Codeforces Round 134 div 2 C题
- Codeforces Round #137 (Div. 2), problem: (C)
- Codeforces Round #153 (Div. 2) C题
- Codeforces Round #158 (Div. 2) C题
- Codeforces Round #162 (Div. 2) C
- Codeforces Round #166 (Div. 2) c. Secret
- Codeforces Round#170(Div 2)C
- 解决问题:onreadystatechange只触发一次
- 安卓 组件Service知识理解
- C4.5决策树代码详细解析以及C4.5程序调用(正确的代码!!!)
- Android开发 音频的录制(MediaRecorder)与播放(MediaPlayer)踩坑记录
- iOS 初始化报错 cannot assign to self outside of a method in the init
- Codeforces Round #225 (Div. 2)-C. Milking cows
- 利用scp 远程上传下载文件/文件夹
- spring加载bean
- 基础总结-Java基础(1)
- LeetCode 118. Pascal's Triangle
- Java 易错知识点
- myeclipse building workspace如何禁止及提高myeclipse速度
- 双系统安装ubuntu教程(制作U盘启动)
- 什么叫做最小生成树( kruskal )