This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n, m, o, s, ans = INT_MIN;
int main(){
cin >> n >> m;
long long a[n+5][m+5], ss[m+5];
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> a[i][j];
if(a[i][j]) o++;
else a[i][j] = -1;
}
}
for(int i = 1; i <= n; i++){
memset(ss, 0, sizeof(ss));
for(int j = i; j <= n; j++){
s = 0;
for(int k = 1; k <= m; k++){
ss[k] += a[j][k];
s = max(ss[k], s+ss[k]);
ans = max(s, ans);
}
}
}
cout << o-ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |