# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1207302 | Dpika | Traffic (IOI10_traffic) | C++20 | 0 ms | 0 KiB |
#include "traffic.h"
#include <bits/stdc++.h>
int LocateCentre(int N, int pp[], int S[], int D[]) {
int v[N+1];
v[0]=0;
for(int i=0;i<N;i++){
v[i+1]=pp[i]+v[i];
}
long long xd=2e9+1;
long long a,b,c;
int Bv;
for(int i=0;i<N;i++){
a=v[i];
b=v[N]-v[i+1];
c=max(a,b);
if(c<xd){
xd=c;
Bv=i;
}
}
return Bv;
}