This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
using namespace std ;
const int maxn=1e5+5 ;
int n, k, a[maxn], cntn=0 ;
namespace sub1{
int ans=0 ;
void Solve(){
for(int i=1 ; i<=n ; i++) ans+=a[i] ;
cout << ans ;
}
}
namespace sub3{
int bs=INT_MIN, res=0 ;
void Solve(){
for(int i=1 ; i<=n ; i++){
res=max(a[i], res+a[i]) ;
bs=max(bs, res) ;
}
cout << bs ;
}
}
signed main(){
ios_base::sync_with_stdio(false) ;
cin.tie(0) ;
cin >> n >> k ;
for(int i=1 ; i<=n ; i++){
cin >> a[i] ;
if(a[i]<0) cntn++ ;
}
if(cntn==0&&k!=1) sub1 :: Solve() ;
if(k==1) sub3:: Solve() ;
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... |