#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
#define endl "\n"
// #define int long long
const int INF = 1e9+7;
const int MOD = 1e9+7;
struct E{
int u, v;
};
void solve(){
int n, m;
cin >> n >> m;
int mx = 0, mxIdx;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
if(a[i] > mx){
mx = a[i];
mxIdx = i;
}
}
vector<E> edges(m);
for(int i = 0; i < m; i++){
cin >> edges[i].u >> edges[i].v;
}
for(int i = 1; i <= mxIdx; i++){
if(a[i] < a[i-1]) a[i] = a[i-1];
}
int sol = 0;
if(mxIdx == 1){
sol += mx;
} else {
for(int i = 1; i <= mxIdx; i++){
if(a[i] == a[i-1]) sol++;
else sol += (a[i] - a[i-1]);
}
}
cout << sol+mx << endl;
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |