제출 #1358646

#제출 시각아이디문제언어결과실행 시간메모리
1358646jump과수원 (NOI14_orchard)C++20
13 / 25
32 ms8152 KiB
#include <bits/stdc++.h>
#define int long long
int arr[1000010];
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int n,m;
  std::cin >> n >> m;
  if(n==1){
    int cost = 0;
    int maxS = 0;
    for(int i=1;i<=m;i++){
      std::cin >> arr[i];
      if(arr[i]==0)arr[i]=-1;
      else cost+=1,arr[i]=1;
    }
    int best = 0;
    for(int i=1;i<=m;i++){
      maxS+=arr[i];
      best=std::max(maxS,best);
      if(maxS<0)maxS=0;
    }
    std::cout << cost - best;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...