T111583 max值PK,求助!ToT
  • 板块灌水区
  • 楼主Braised_fish
  • 当前回复6
  • 已保存回复6
  • 发布时间2024/7/30 10:53
  • 上次更新2024/7/30 12:08:01
查看原帖
T111583 max值PK,求助!ToT
992550
Braised_fish楼主2024/7/30 10:53

36分,ToT,(ノへ ̄、),(ಥ _ ಥ)

#include "bits/stdc++.h"
using namespace std;  
  
int main() {  
    int n;  
    cin >> n;  
    vector<int> a(n);  
    for (int i = 0; i < n; ++i) {  
        cin >> a[i];  
    }     
    vector<int> p(n), s(n);  
    p[0] = a[0];  
    for (int i = 1; i < n; ++i) {  
        p[i] = max(p[i - 1], a[i]);  
    }  
    s[n - 1] = a[n - 1];  
    for (int i = n - 2; i >= 0; --i) {  
        s[i] = max(s[i + 1], a[i]);  
    }  
    int m = 0;  
    for (int i = 0; i < n - 1; ++i) {  
        int mA = p[i];  
        int mB = s[i + 1];  
        m = max(m, abs(mA - mB));  
    }  
  
    cout << m << endl;  
    return 0;  
}
2024/7/30 10:53
加载中...