oj.uz

답안 #373110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373110 2021-03-03T11:59:17 Z sam571128 Sjeckanje (COCI21_sjeckanje) C++14
55 / 110
 2000 ms 7404 KB 
#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 2e5+5;
int dp[N][2]; //The maximum sum when we get to the ith element and is ascend/descending

signed main(){
	fastio
	int n,q;
	cin >> n >> q;
	int arr[n+1];
	for(int i = 1;i <= n;i++){
		cin >> arr[i];
	}
	while(q--){
		int l,r,x;
		cin >> l >> r >> x;
		for(int i = l;i <= r;i++) arr[i] += x;
		dp[1][0] = dp[1][1] = 0;
		for(int i = 2;i <= n;i++){
			if(arr[i]>=arr[i-1]){
				dp[i][0] = max(dp[i-1][0]+arr[i]-arr[i-1],dp[i-1][1]);
				dp[i][1] = max(dp[i-1][0],dp[i-1][1]);
			}else if(arr[i] < arr[i-1]){
				dp[i][0] = max(dp[i-1][0],dp[i-1][1]);
				dp[i][1] = max(dp[i-1][0],dp[i-1][1]+arr[i-1]-arr[i]);
			}
		}
		cout << max(dp[n][0],dp[n][1]) << "\n";
	}
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 48 ms 620 KB Output is correct
8 Correct 47 ms 620 KB Output is correct
9 Correct 52 ms 492 KB Output is correct
10 Correct 50 ms 620 KB Output is correct
11 Correct 52 ms 492 KB Output is correct
12 Correct 45 ms 620 KB Output is correct

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 48 ms 620 KB Output is correct
8 Correct 47 ms 620 KB Output is correct
9 Correct 52 ms 492 KB Output is correct
10 Correct 50 ms 620 KB Output is correct
11 Correct 52 ms 492 KB Output is correct
12 Correct 45 ms 620 KB Output is correct
13 Execution timed out 2065 ms 7404 KB Time limit exceeded
14 Halted 0 ms 0 KB -