#include <bits/stdc++.h>
using namespace std;
#define forp(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#define newl '\n'
void solve(){
ll n,k; cin>>n>>k;
ll ans=0,c;
forp(i,1,n){
cin>>c;
ans=max(ans+c,c);
}
cout<<ans<<newl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
31 ms |
204 KB |
Output is correct |
2 |
Correct |
40 ms |
296 KB |
Output is correct |
3 |
Correct |
34 ms |
204 KB |
Output is correct |
4 |
Correct |
38 ms |
204 KB |
Output is correct |
5 |
Correct |
35 ms |
296 KB |
Output is correct |
6 |
Correct |
30 ms |
312 KB |
Output is correct |
7 |
Correct |
29 ms |
204 KB |
Output is correct |
8 |
Correct |
35 ms |
204 KB |
Output is correct |
9 |
Correct |
34 ms |
204 KB |
Output is correct |
10 |
Correct |
29 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
312 KB |
Output is correct |
2 |
Correct |
26 ms |
204 KB |
Output is correct |
3 |
Incorrect |
18 ms |
312 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
37 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
31 ms |
204 KB |
Output is correct |
2 |
Correct |
40 ms |
296 KB |
Output is correct |
3 |
Correct |
34 ms |
204 KB |
Output is correct |
4 |
Correct |
38 ms |
204 KB |
Output is correct |
5 |
Correct |
35 ms |
296 KB |
Output is correct |
6 |
Correct |
30 ms |
312 KB |
Output is correct |
7 |
Correct |
29 ms |
204 KB |
Output is correct |
8 |
Correct |
35 ms |
204 KB |
Output is correct |
9 |
Correct |
34 ms |
204 KB |
Output is correct |
10 |
Correct |
29 ms |
204 KB |
Output is correct |
11 |
Correct |
20 ms |
312 KB |
Output is correct |
12 |
Correct |
26 ms |
204 KB |
Output is correct |
13 |
Incorrect |
18 ms |
312 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |