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>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
int n, k; vector<ll> a={0};
void f(){
vector<ll> p=a;
for(int i=1; i<n; i++) p[i]+=p[i-1];
ll ans=0;
for(int i=0; i<n; i++){
for(int j=0; j<i; j++){
ans=max(ans, p[i]-p[j]);
}
}
cout << ans << endl;
return;
}
int main(){
cin >> n >> k;
for(int i=0; i<n; i++){
ll x; cin >> x;
a.pb(x);
}
if(k==1) f();
else{
ll cnt=0;
for(int i=0; i<n; i++) if(a[i]>0) cnt+=a[i];
cout << cnt << endl;
}
}
# | 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... |