Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃\○/
- ┛┗┛┗┛┃ / /
- ┓┏┓┏┓┃ノ
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃
- ┛┗┛┗┛┃
- ┓┏┓┏┓┃┓
- ┛┗┛┗┛┃┃
- MIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSIC
- */
- // #define pragma
- #ifdef pragma
- #pragma GCC optimize("Ofast")
- #pragma GCC optimize("no-stack-protector")
- #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
- #pragma GCC optimize("unroll-loops")
- #pragma GCC diagnostic ignored "-Wunused-result"
- #endif // pragma
- #include<bits/stdc++.h>
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- #define ll long long
- #define all(x) begin(x), end(x)
- #define pb push_back
- #define x first
- #define y second
- #define int long long
- #define zero(two) memset(two, 0, sizeof(two))
- using namespace std;
- using namespace __gnu_pbds;
- typedef vector<int> vi;
- typedef vector<bool> vb;
- typedef pair<int, int> pii;
- typedef long double ld;
- typedef vector<vi> matrix;
- template<typename T>
- using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
- const ld PI = atan2(0, -1);
- void seriy() {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- cout << fixed << setprecision(10);
- #if _offline
- freopen("input", "r", stdin);
- freopen("output", "w", stdout);
- #endif
- }
- const int INF = 1e9 + 7;
- const int MAXN = 101;
- signed main() {
- seriy();
- // int n;
- // cin >> n;
- // vi tmp(n);
- // for(int i = 0; i < n; i++) {
- // cin >> tmp[i];
- // }
- // stack<int> indl, indr;
- // vi ml(n), mr(n);
- // for(int i = 0; i < n; i++) {
- // while(indl.size() && tmp[indl.top()] >= tmp[i]) {
- // indl.pop();
- // }
- // ml[i] = ((!indl.size()) ? 0 : indl.top() + 1);
- // indl.push(i);
- // }
- // for(int i = n - 1; i >= 0; i--) {
- // while(indr.size() && tmp[indr.top()] >= tmp[i]) {
- // indr.pop();
- // }
- // mr[i] = ((!indr.size()) ? n - 1 : indr.top() - 1);
- // indr.push(i);
- // }
- int a, b, c;
- cin >> a >> b >> c;
- if(a > 40 || b > 40 || c > 40) {
- assert(0);
- }
- vi log(MAXN);
- for(int i = 1; i < MAXN; i++) {
- int cnt = 0;
- while((1 << (cnt + 1)) < i) {
- cnt++;
- }
- log[i] = cnt;
- cerr << i << " " << log[i] << '\n';
- }
- bool m[a][b][c];
- int d[b][c];
- for(int j = 0; j < b; j++) {
- for(int k = 0; k < c; k++) {
- d[j][k] = -1;
- }
- }
- for(int i = 0; i < a; i++) {
- for(int j = 0; j < b; j++) {
- for(int k = 0; k < c; k++) {
- char ch;
- cin >> ch;
- m[i][j][k] = (ch == '1');
- }
- }
- }
- int ans = 0;
- int t[MAXN][MAXN][10];
- for(int i = 0; i < a; i++) {
- for(int j = 0; j < b; j++) {
- for(int k = 0; k < c; k++) {
- for(int st = 0; st < 10; st++) {
- t[k][j][st] = -INF;
- }
- }
- }
- for(int j = 0; j < b; j++) {
- for(int k = 0; k < c; k++) {
- if(m[i][j][k]) {
- d[j][k] = i;
- }
- t[k][j][0] = d[j][k];
- }
- }
- for(int j = 0; j < b; j++) {
- for(int k = 0; k < c; k++) {
- for(int st = 1; st < 10; st++) {
- if(j + (1 << st) < c) {
- t[k][j][st] = max(t[k][j][st - 1], t[k][j + (1 << (st - 1))][st - 1]);
- }
- }
- }
- }
- for(int j = 0; j < b; j++) {
- for(int k = j; k < b; k++) {
- vi tmp(c);
- for(int h = 0; h < c; h++) {
- int lg = log[k - j + 1];
- int mx = max(t[h][j][lg], t[h][k - lg + 1][lg]);
- tmp[h] = i - mx;
- cerr << i << " " << j << " " << k << " " << h << " " << mx << '\n';
- }
- stack<int> indl, indr;
- vi ml(c), mr(c);
- // cerr << i << " " << j << " " << k << " ";
- for(int h = 0; h < c; h++) {
- while(indl.size() && tmp[indl.top()] >= tmp[h]) {
- indl.pop();
- }
- ml[h] = ((!indl.size()) ? 0 : indl.top() + 1);
- indl.push(h);
- }
- for(int h = c - 1; h >= 0; h--) {
- while(indr.size() && tmp[indr.top()] >= tmp[h]) {
- indr.pop();
- }
- mr[h] = ((!indr.size()) ? c - 1 : indr.top() - 1);
- // cerr << "{" << ml[h] << ", " << mr[h] << "} ";
- indr.push(h);
- }
- // cerr << '\n';
- int res = 0;
- for(int h = 0; h < c; h++) {
- res = max(res, (mr[h] - ml[h] + 1) * tmp[h]);
- }
- ans = max(ans, res * (k - j + 1));
- }
- }
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement