// #include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
int LocateCentre(int n, int p[], int s[], int d[]){
    vector<int> pref(n+1, 0), suff(n+1, 0);
    pref[0] = p[0];
    suff[n-1] = p[n-1];
    for(int i = 1; i < n; i++){
        pref[i] += pref[i-1] + p[i];
    }
    for(int j = n-2; j >= 0; j--){
        suff[j] += suff[j+1] + p[j];
    }int mn = INT_MAX;
    for(int i = 0; i < n; i++){
        mn = min(mn, max(pref[i]-p[i], suff[i]-p[i]));
    }return mn;
}
// int main(){
//     int n;
//     cin >> n;
//     int p[n],s[n-1], d[n-1];
//     for(int i = 0; i < n; i++){
//         cin >> p[i];
//     } 
//     for(int i = 0; i < n-1; i++){
//         cin >> s[i] >> p[i];
//     }cout << LocateCentre(n, p, s, d);
// }
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |