제출 #914414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
914414		ReLice	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	87 ms	17892 KiB

ho_t1

#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool f=0;
    if (x>y){x=y;f=1;}
    return f;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool f=0;
    if (x<y){x=y;f=1;}
    return f;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
void solve(){
    ll i,j;
    ll n;
    cin>>n;
    vll a(n+5),b(n+1,0);
    pll v(1,{0,0});
    for(i=1;i<=1+n;i++) {
        cin>>a[i];
        v.pb({a[i],i});
    }
    sort(all(v));
    for(i=1;i<=n;i++) cin>>b[i];
    sort(all(b));
    ll pref[n+5],suf[n+5];
    pref[0]=suf[n+2]=0;
    for(i=1;i<=n;i++) pref[i]=max(pref[i-1],max(v[i].fr-b[i],0ll));
    for(i=n+1;i>1;i--) suf[i]=max(suf[i+1],max(v[i].fr-b[i-1],0ll));
    ll ans[n+5];
    for(i=1;i<=n+1;i++) ans[v[i].sc]=max(pref[i-1],suf[i+1]);
    for(i=1;i<=n+1;i++) cout<<ans[i]<<' ';
    cout<<endl;

}

signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*



*/

컴파일 시 표준 에러 (stderr) 메시지

ho_t1.cpp: In function 'void solve()':
ho_t1.cpp:46:10: warning: unused variable 'j' [-Wunused-variable]
   46 |     ll i,j;
      |          ^

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91