Saturday, June 22, 2024

# Codeforces Round #408 (Div. 2), problem: (C) Bank Hacking Solution in C

#include <limits.h>
#include <stdio.h>
#include <stdlib.h>

#define N 300000

struct E {
int i, j, a;
} ee[N * 2];

int aa[N], ii[N];

int compare1(const void *a, const void *b) {
int *ia = (int *) a;
int *ib = (int *) b;
int i = *ia;
int j = *ib;

return aa[j] != aa[i] ? aa[j] – aa[i] : i – j;
}

int compare2(const void *a, const void *b) {
struct E *pa = (struct E *) a;
struct E *pb = (struct E *) b;

return pa->i != pb->i ? pa->i – pb->i
: (pa->a != pb->a ? pb->a – pa->a : pa->j – pb->j);
}

int main() {
int n, m, g, h, i, j, min, max;

scanf(“%d”, &n);
for (i = 0; i < n; i++) {
scanf(“%d”, &aa[i]);
ii[i] = i;
}
if (n == 1) {
printf(“%d\n”, aa[0]);
return 0;
}
qsort(ii, n, sizeof *ii, compare1);
for (h = 0; h < n – 1; h++) {
struct E *e0, *e1;

scanf(“%d%d”, &i, &j);
i–, j–;
e0 = &ee[h * 2 + 0];
e1 = &ee[h * 2 + 1];
e0->i = i, e0->j = j, e0->a = aa[j];
e1->i = j, e1->j = i, e1->a = aa[i];
}
m = (n – 1) * 2;
qsort(ee, m, sizeof *ee, compare2);
min = INT_MAX;
for (h = 0, i = 0; h < m; i++) {
max = aa[i];
g = h;
j = 0;
while (g < m && ee[g].i == i) {
if (max < aa[ee[g].j] + 1)
max = aa[ee[g].j] + 1;
while (j < n && (ii[j] == ee[g].j || ii[j] == i))
j++;
g++;
}
if (j < n && max < aa[ii[j]] + 2)
max = aa[ii[j]] + 2;
if (min > max)
min = max;
h = g;
}
printf(“%d\n”, min);
return 0;
}

## Celebrating Black History Month:...

As February unfolds, so does the annual celebration of...

## The Path to Self-Mastery:...

Embarking on a journey of self-mastery and breaking free...

## Wizards of Waverly Place...

In a spellbinding announcement, Disney has officially revealed that...

## Jim Irsay’s Reported ‘Suspected...

In a shocking turn of events last month, Jim...

Coachella Valley Music and Arts Festival, one of the...

## 2024 Taiwan Election: Pivotal...

As Taiwan gears up for its 2024 presidential election,...

### Celebrating Black History Month: Past, Future

As February unfolds, so does the annual celebration of Black History Month, a time to reflect on the profound contributions, resilience, and rich cultural...

### The Path to Self-Mastery: Lessons from Book ‘The Mountain Is You’

Embarking on a journey of self-mastery and breaking free from self-sabotage is a transformative process that requires dedication and conscious effort. Brianna Wiest's insightful...

### Wizards of Waverly Place Cast Reunites for Enchanting Revival

In a spellbinding announcement, Disney has officially revealed that the beloved fantasy series "Wizards of Waverly Place" is set for a magical comeback, featuring...

### Jim Irsay’s Reported ‘Suspected Overdose’: A Closer Look

In a shocking turn of events last month, Jim Irsay, the owner of the Indianapolis Colts, was reportedly found unresponsive at his home in...

### Coachella 2024: Iconic headliners, unforgettable musical experience!

Coachella Valley Music and Arts Festival, one of the most iconic and eagerly anticipated music festivals globally, has just dropped its highly anticipated lineup...

### 2024 Taiwan Election: Pivotal Moment in Political Landscape

As Taiwan gears up for its 2024 presidential election, the political landscape is buzzing with anticipation and fervor. With the island nation situated at...

### Michael Strahan’s Daughter’s Medulloblastoma Diagnosis

In a recent and heartbreaking revelation, Michael Strahan, former NFL star and television personality, shared the devastating news of his daughter Isabella's diagnosis with...

### Michigan vs. Washington: The 2024 National Championship Clash

In a highly anticipated matchup, the 2024 National Championship will witness a clash of football titans as the Michigan Wolverines square off against the...

### Jason Kelce: Unmasking the Unconventional NFL Icon

In the world of professional football, where conformity often takes center stage, one player stands out as a beacon of individuality, both on and...