Submission #837124

#TimeUsernameProblemLanguageResultExecution timeMemory
837124makanhuliaOrchard (NOI14_orchard)C++17
25 / 25
101 ms19884 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define ull unsigned long long #define pii pair<int, int> #define pll pair<ll, ll> #define fi first #define se second const int N = 2e5 + 5; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m, ans = 0; cin >> n >> m; vector<vector<int>> a(n + 1, vector<int>(m + 1, 0)), pref(n + 1, vector<int>(m + 1, 0)); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; if (a[i][j] == 1) ans--; else a[i][j] = -1; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) pref[i][j] = pref[i - 1][j] + a[i][j]; } int mx = 0; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { int sum = 0; for (int k = 1; k <= m; k++) { sum = max(0, sum + pref[j][k] - pref[i - 1][k]); mx = max(mx, sum); } } } cout << -1 * (ans + mx) << "\n"; }
#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...