# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377699 | AlexRex0 | Traffic (IOI10_traffic) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
long long int a[1000002];
static int N,P[1000000],S[1000000],D[1000000];
int LocateCentre(int N, int pp[], int S[], int D[]) {
int res = 0;
long long int menor = 2000000000000001;
a[0] = 0;
a[N + 1] = 0;
for(int i = 1; i <= N; ++i){
a[i] = pp[i - 1] + a[i - 1];
}
for(int i = 2; i < N; ++i){
long long int aux = a[N] - a[i];
long long int aux2 = a[i - 1];
aux = max(aux, aux2);
if(aux < menor){
menor = aux;
res = i;
}
}
long long int aux = 0;
aux = a[N] - a[1];
if(aux < menor){
menor = aux;
res = 1;
}
aux = a[N - 1];
if(aux < menor){
menor = aux;
res = N;
}
res--;
return res;
}
int main(){
int i;
scanf("%d",&N);
for (i=0;i<N;i++) scanf("%d",&P[i]);
for (i=0;i<N-1;i++) scanf("%d%d",&S[i],&D[i]);
int r = LocateCentre(N,P,S,D);
printf("%d\n",r);
return 0;
}