This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_3_B #include<bits/stdc++.h> using namespace std; #define call_from_test #include "../../tools/chminmax.cpp" #include "../../algorithm/largestrectangle.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int h,w; cin>>h>>w; vector< vector<int> > cs(h,vector<int>(w)); for(int i=0;i<h;i++) for(int j=0;j<w;j++) cin>>cs[i][j]; int res=0; vector<int> dp(w,0); for(int i=0;i<h;i++){ for(int j=0;j<w;j++) dp[j]=cs[i][j]==0?dp[j]+1:0; chmax(res,largestrectangle(dp)); } cout<<res<<endl; return 0; }
#line 1 "test/aoj/DPL_3_B.test.cpp" // verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_3_B #include<bits/stdc++.h> using namespace std; #define call_from_test #line 1 "tools/chminmax.cpp" #line 3 "tools/chminmax.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;} template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;} //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #line 1 "algorithm/largestrectangle.cpp" #line 3 "algorithm/largestrectangle.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename T> T largestrectangle(vector<T> &v){ int n=v.size(); T res=0; using P = pair<int, T>; stack<P> sp; sp.emplace(-1,T(0)); for(int i=0;i<n;i++){ int j=i; while(sp.top().second>v[i]){ j=sp.top().first; res=max(res,(i-j)*sp.top().second); sp.pop(); } if(sp.top().second<v[i]) sp.emplace(j,v[i]); } while(!sp.empty()){ res=max(res,(n-sp.top().first)*sp.top().second); sp.pop(); } return res; } //END CUT HERE #ifndef call_from_test //INSERT ABOVE HERE signed main(){ return 0; } #endif #line 9 "test/aoj/DPL_3_B.test.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); int h,w; cin>>h>>w; vector< vector<int> > cs(h,vector<int>(w)); for(int i=0;i<h;i++) for(int j=0;j<w;j++) cin>>cs[i][j]; int res=0; vector<int> dp(w,0); for(int i=0;i<h;i++){ for(int j=0;j<w;j++) dp[j]=cs[i][j]==0?dp[j]+1:0; chmax(res,largestrectangle(dp)); } cout<<res<<endl; return 0; }