Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|---|
123556 | 黄一航 | 排队 | C++ | 通过 | 100 | 0 MS | 284 KB | 407 | 2024-01-23 08:32:07 |
#include <bits/stdc++.h> #define int long long using namespace std; int sa1[30005],sa2[30005]; int n; signed main() { cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x; sa1[i] = sa1[i - 1] + (x == 1); sa2[i] = sa2[i - 1] + (x == 2); } int minn = 9e18; for (int i = 0; i <= n; i++) minn = min(minn,sa2[i] + (sa1[n] - sa1[i])); printf("%lld\n",minn); return 0; }