/* -*- coding: utf-8 -*- * * 2100.cc: No.2100 [Cherry Alpha C] Two-way Steps - yukicoder */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; /* constant */ const int MAX_N = 100000; const int MAX_GN = MAX_N * 2; const int INF = 1 << 30; const long long LINF = 1LL << 60; enum { UP, DOWN }; /* typedef */ typedef long long ll; typedef vector vi; typedef queue qi; typedef pair pii; /* global variables */ int hs[MAX_N]; vi nbrs[MAX_N], rnbrs[MAX_N]; ll dp[MAX_N][2]; /* subroutines */ inline void setmax(ll &a, ll b) { if (a < b) a = b; } /* main */ int main() { int n, m; scanf("%d%d", &n, &m); for (int i = 0; i < n; i++) scanf("%d", hs + i); for (int i = 0; i < m; i++) { int u, v; scanf("%d%d", &u, &v); u--, v--; nbrs[u].push_back(v); rnbrs[v].push_back(u); } for (int u = 0; u < n; u++) dp[u][UP] = dp[u][DOWN] = -1; dp[0][UP] = dp[0][DOWN] = 0; for (int u = 0; u < n; u++) { if (dp[u][UP] >= 0) for (auto v: nbrs[u]) if (hs[u] > hs[v]) setmax(dp[v][DOWN], dp[u][UP]); if (dp[u][DOWN] >= 0) for (auto v: nbrs[u]) { if (hs[u] < hs[v]) setmax(dp[v][UP], dp[u][DOWN] + hs[v] - hs[u]); else setmax(dp[v][DOWN], dp[u][DOWN]); } } ll d0 = max(dp[n - 1][UP], dp[n - 1][DOWN]); for (int u = 0; u < n; u++) dp[u][UP] = dp[u][DOWN] = -1; dp[n - 1][UP] = dp[n - 1][DOWN] = 0; for (int u = n - 1; u >= 0; u--) { if (dp[u][UP] >= 0) for (auto v: rnbrs[u]) if (hs[u] > hs[v]) setmax(dp[v][DOWN], dp[u][UP]); if (dp[u][DOWN] >= 0) for (auto v: rnbrs[u]) { if (hs[u] < hs[v]) setmax(dp[v][UP], dp[u][DOWN] + hs[v] - hs[u]); else setmax(dp[v][DOWN], dp[u][DOWN]); } } ll d1 = max(dp[0][UP], dp[0][DOWN]); printf("%lld\n%lld\n", d0, d1); return 0; }