제출 #1347357

#제출 시각아이디문제언어결과실행 시간메모리
1347357m0rtu_us0512Snacks (NOI25_snacks)C++20
0 / 100
39 ms1976 KiB
#include <bits/stdc++.h>
using namespace std;

vector<int64_t> A;
int64_t N, D;

int main(){
    cin >> N >> D;
    A.assign( N , 0 );
    for ( auto &a : A )
        cin >> a;
    // for ( auto &a : A )
    //     cout << a << endl;
    // int64_t h = A.front() ;
    // int64_t h = A[0] ;

    // int64_t h = A[N-1] ;
    int64_t h = A.back() ; // last element of A
    int64_t ans = A.back();
    for ( int n = A.size()-2 ; n > 0 ; n-- ){
        h = max( h , A[n] );
        ans += h;
        // cout << h << " " << ans << endl;
    }
    cout << ans << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...