제출 #1328449

#제출 시각아이디문제언어결과실행 시간메모리
1328449ArielCruzFeast (NOI19_feast)C++20
22 / 100
96 ms2756 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    long long n,k,acum=0,maxi=0,a1=0; cin>>n>>k;
    vector<long long> a(n);
    a1=a[0];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<n;i++){
        acum+=a[i];
        maxi=max(acum,maxi);
        if(acum<0) acum=0;
    }
    cout<<maxi<<"\n";
}
#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...