#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int nax = 200005;
int N, M, Q;
i64 S[nax];
vector<int> G[nax];
namespace subtask1 {
i64 solve() {
i64 ans = 0;
for (int i = 2; i <= N; i++) ans += max(S[i], S[i - 1]);
for (int i = 1; i < N; i++) ans -= max(0LL, S[i] - S[i + 1]);
return ans;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin >> N >> M >> Q;
for (int i = 1; i <= N; i++) cin >> S[i];
for (int i = 0; i < M; i++) {
int u, v; cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
i64 ans = subtask1::solve();
reverse(S + 1, S + 1 + N);
ans = max(ans, subtask1::solve());
cout << ans << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4956 KB |
Output is correct |
2 |
Correct |
47 ms |
12744 KB |
Output is correct |
3 |
Correct |
46 ms |
12828 KB |
Output is correct |
4 |
Incorrect |
50 ms |
12884 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4956 KB |
Output is correct |
2 |
Correct |
47 ms |
12744 KB |
Output is correct |
3 |
Correct |
46 ms |
12828 KB |
Output is correct |
4 |
Incorrect |
50 ms |
12884 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4956 KB |
Output is correct |
2 |
Correct |
47 ms |
12744 KB |
Output is correct |
3 |
Correct |
46 ms |
12828 KB |
Output is correct |
4 |
Incorrect |
50 ms |
12884 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4956 KB |
Output is correct |
2 |
Correct |
47 ms |
12744 KB |
Output is correct |
3 |
Correct |
46 ms |
12828 KB |
Output is correct |
4 |
Incorrect |
50 ms |
12884 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
4952 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
4952 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4956 KB |
Output is correct |
2 |
Correct |
47 ms |
12744 KB |
Output is correct |
3 |
Correct |
46 ms |
12828 KB |
Output is correct |
4 |
Incorrect |
50 ms |
12884 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |