| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347357 | m0rtu_us0512 | Snacks (NOI25_snacks) | C++20 | 39 ms | 1976 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 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
