Submission #170351

#TimeUsernameProblemLanguageResultExecution timeMemory
170351ngmh과수원 (NOI14_orchard)C++11
25 / 25
294 ms18168 KiB
#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 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...