Submission #1102806

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102806		DanerZein	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	149 ms	10836 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
int main(){
  int n; cin>>n;
  vector<ii> neck(n+1);
  vector<int> ori(n);
  int c=0;
  for(auto &v:neck) {
    cin>>v.first;
    v.second=c++;
  }
  for(auto &v:ori) cin>>v;
  
  
  sort(neck.begin(),neck.end());
  sort(ori.begin(),ori.end());

  vector<int> front(n),back(n);
  for(int i=0;i<n;i++){
    front[i]=max(
		 i>0?front[i-1]:0,
		 max(neck[i].first-ori[i],0));
  }
  for(int i=n-1;i>=0;i--){
    back[i]=max(
		i<n-1?back[i+1]:0,
		max(neck[i+1].first-ori[i],0));
  }

  vector<int> ans(n+1);
  
  for(int i=0;i<=n;i++){
    ans[neck[i].second]=max(
	      i>0?front[i-1]:0,
	      i<n?back[i]:0);
  }
  for(auto &v:ans) cout<<v<<" ";
  cout<<endl;
  
}

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