제출 #51210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51210		BrunoPloumhans	과수원 (NOI14_orchard)	C++14	25 / 25	219 ms	20652 KiB

orchard

#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;

  int cost = 0;
  vector<vector<int>> sums(n, vector<int>(m, 0));
  for(int i = 0; i < n; ++i) {
    for(int j = 0; j < m; ++j) {
      int x;
      cin >> x;
      sums[i][j] = (x == 1 ? 1 : -1);
      if(x == 1) {
	++cost;
      }
      /*if(i > 0) sums[i][j] += sums[i-1][j];
      if(j > 0) sums[i][j] += sums[i][j-1];
      if(i > 0 && j > 0) sums[i][j] -= sums[i-1][j-1];*/
      if(i > 0) {
	sums[i][j] += sums[i-1][j];
      }
    }
  }


  int ma = 0;
  for(int i = 0; i < n; ++i) {
    for(int j = i; j < n; ++j) {
      int cumul = 0;
      for(int k = 0; k < m; ++k) {
	cumul += sums[j][k];
	if(i > 0) {
	   cumul -= sums[i-1][k];
	}
	ma = max(ma, cumul);
	if(cumul < 0) {
	  cumul = 0;
	}
      }
    }
  }
  cout << cost - ma << endl;
  return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 5 / 5
• Subtask 4: 3 / 3
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5