oj.uz

답안 #734739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734739 2023-05-03T03:03:51 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define sts stable_sort
using namespace std;

const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n; cin >> n;
    vector<ll> v(n + 1);
    vector<ll> asd(n + 1);
    vector<ll> b(n);

    for(int i = 0; i <= n; i++){
        cin >> v[i];
        asd[i] = v[i];
    }
    sts(v.B, v.E);

    for(int i = 0; i < n; i++){
        cin >> b[i];
    }
    sts(b.B, b.E);
    map<ll, ll> m;
    map<ll, ll> mmax;

    ll maxdesp = 0;
    for(int i = n; i > 0; i--){
        maxdesp = max(maxdesp, (v[i] - b[i - 1]));
//        cout << maxdesp << " " << i << "\n";
        mmax[i] = maxdesp;
    }

    ll maxant = 0;
    for(int i = 0; i <= n; i++){
        if(i < n){
            maxant = max(maxant, (v[i] - b[i]));
        }
//        cout << maxant << "\n";
        m[v[i]] = max(maxant, mmax[i + 1]);
    }

    for(int i = 0; i <= n; i++){
        cout << m[v[i]] << " ";
    }cout << "\n";

    return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -