제출 #1228886

#제출 시각아이디문제언어결과실행 시간메모리
1228886ripolasFeast (NOI19_feast)C++20
12 / 100
74 ms2764 KiB
#include <bits/stdc++.h> using namespace std; const int INF = 10e8; #define int long long signed main(){ int n,k; cin>>n>>k; vector<int> a (n); int ans = 0; int ansL = 0; int ansR = 0; bool startR = false; for(int i = 0;i<n;i++){ cin>>a[i]; ans+=a[i]; if(startR){ ansR+=a[i]; } if(a[i]<0){ ansL = ans-a[i]; startR = true; } } if(k==1){ cout<<max({ans,ansL,ansR})<<endl; }else{ cout<<max({ans,ansL+ansR})<<endl; } }
#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...