| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1357202 | sim_ple | Feast (NOI19_feast) | C++20 | 18 ms | 2776 KiB |
/*
written by sim_ple
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 500005
#define itn int
#define all(x) x.begin() , x.end()
void solve(){
int n , k;
cin >> n >> k;
int sum = 0 , mx = 0;
int a[n + 1];
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 1; i <= n; i++){
sum += a[i];
mx = max(mx , sum);
sum = max(sum , 0ll);
}
cout << sum << endl;
}
int32_t main() {
ios::sync_with_stdio(false);cin.tie(nullptr);
int t = 1;
//cin >> t;
while(t--) solve();
}| # | 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... | ||||
