제출 #203061

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

ho_t1

#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

int b[N], n, pref[N], suff[N], ans[N];
pii a[N];


main () {
	cin >> n;
	forn (i, 1, n + 1) {
		cin >> a[i].f; 
		a[i].s = i;
	}

	forn (i, 1, n)
		cin >> b[i];

	sort(a + 1, a + 2 + n);
	sort(b + 1, b + 1 + n);
	forn (i, 1, n)
		pref[i] = max(pref[i - 1], a[i].f - b[i]);

	forev (i, n, 1) 
		suff[i] = max(suff[i + 1], a[i + 1].f - b[i]);

	forn (i, 1, n + 1)
		ans[a[i].s] =  max(pref[i - 1], suff[i]);	
	forn (i, 1, n + 1)
		cout << ans[i] << ' ';
	return 0;			
}

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

ho_t1.cpp:44:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

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