procon

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub mugen1337/procon

:heavy_check_mark: test/AOJ_DPL_3_c.test.cpp

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_3_C&lang=ja"

#include "../template.hpp"

#include "../DP/LargestRectangle.hpp"

signed main(){
    int n;cin>>n;
    vector<ll> v(n);
    cin>>v;
    cout<<LargestRectangle(v)<<endl;
    return 0;
}
#line 1 "test/AOJ_DPL_3_c.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_3_C&lang=ja"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

#line 4 "test/AOJ_DPL_3_c.test.cpp"

#line 1 "DP/LargestRectangle.hpp"
template<typename INT>
INT LargestRectangle(vector<INT> v){
    int n=(int)v.size();
    INT inf=numeric_limits<INT>::max()/2;
    stack<pair<INT,INT>> st;
    st.emplace(-inf,-1);// ばんぺいん
    INT ret=0;
    for(int i=0;i<n;i++){
        while(v[i]<st.top().first){
            auto p=st.top();st.pop();
            ret=max(ret,(i-st.top().second-1)*p.first);
        }
        st.emplace(v[i],i);
    }
    while(!st.empty()){
        auto p=st.top();st.pop();
        if(p.first==-inf) continue;
        ret=max(ret,(n-st.top().second-1)*p.first);
    }
    return ret;
}
#line 6 "test/AOJ_DPL_3_c.test.cpp"

signed main(){
    int n;cin>>n;
    vector<ll> v(n);
    cin>>v;
    cout<<LargestRectangle(v)<<endl;
    return 0;
}
Back to top page