| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 125506 | 蒋沛霖 | 排队 | C++ | Accepted | 100 | 0 MS | 260 KB | 403 | 2024-01-23 17:05:00 |
#include <bits/stdc++.h> using namespace std; const int N=3e4+10; const int INF=0x3f3f3f3f; int n,s[N],ans=INF; short a[N]; int main() { cin>>n; int x; for(int i=1;i<=n;i++) { cin>>x; if(x==1) { a[i]=0; } else { a[i]=1; } s[i]=s[i-1]+a[i]; } for(int i=0;i<=n;i++) { int p=(n-i)-(s[n]-s[i])+s[i]; ans=min(ans,p); } cout<<ans; return 0; }