#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={};
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]);
ans=max(ans, p[i]);
}
}
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;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
80 ms |
4408 KB |
Output is correct |
2 |
Correct |
84 ms |
4600 KB |
Output is correct |
3 |
Correct |
87 ms |
4404 KB |
Output is correct |
4 |
Correct |
81 ms |
4468 KB |
Output is correct |
5 |
Correct |
81 ms |
4496 KB |
Output is correct |
6 |
Correct |
79 ms |
4408 KB |
Output is correct |
7 |
Correct |
84 ms |
4508 KB |
Output is correct |
8 |
Correct |
81 ms |
4488 KB |
Output is correct |
9 |
Correct |
80 ms |
4456 KB |
Output is correct |
10 |
Correct |
80 ms |
4476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1048 ms |
4996 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1046 ms |
5044 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
80 ms |
4408 KB |
Output is correct |
2 |
Correct |
84 ms |
4600 KB |
Output is correct |
3 |
Correct |
87 ms |
4404 KB |
Output is correct |
4 |
Correct |
81 ms |
4468 KB |
Output is correct |
5 |
Correct |
81 ms |
4496 KB |
Output is correct |
6 |
Correct |
79 ms |
4408 KB |
Output is correct |
7 |
Correct |
84 ms |
4508 KB |
Output is correct |
8 |
Correct |
81 ms |
4488 KB |
Output is correct |
9 |
Correct |
80 ms |
4456 KB |
Output is correct |
10 |
Correct |
80 ms |
4476 KB |
Output is correct |
11 |
Execution timed out |
1048 ms |
4996 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |