Submission #833159

#TimeUsernameProblemLanguageResultExecution timeMemory
833159veehjFeast (NOI19_feast)C++17
30 / 100
107 ms4948 KiB
#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() {
  ll ans = 0, nw = 0;
  for (auto& u : a) {
    nw = max(0LL, nw + u);
    ans = max(ans, nw);
  }
  cout << ans << endl;
  return;
}

int main() {
  cin >> n >> k;
  vector<ll> v;
  for (int i = 0; i < n; i++) {
    ll x;
    cin >> x;
    a.pb(x);
  }
  if (k == 1) {
    f();
    return 0;
  }
  ll cnt = 0;
  for (auto& u : a)
    if (u > 0) cnt += u;
  cout << cnt << 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...