oj.uz

답안 #971887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971887 2024-04-29T12:45:40 Z jadai007 Global Warming (CEOI18_glo) C++17
15 / 100
 2000 ms 3420 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

int n,x, arr[200200], p, dp[200200], ans;

signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> x;
    for(int i = 0; i<n; ++i) cin >> arr[i];
    if(x == 0){
        for(int i = 0; i<n; ++i){
            int idx = lower_bound(dp, dp+p, arr[i]) - dp;
            if(idx == p) ++p;
            dp[idx] = arr[i];
        }
        cout << p;
        return 0;
    }
    for(int d = -x; d<=x; ++d){
        for(int i = 0; i<n; ++i){
            deque<int> dq;
            for(int j = i; j<n; ++j){
                dq.push_back(arr[j]);
                arr[j]+=d;
                memset(dp, 0, sizeof(dp)); p = 0;
                for(int k = 0; k<n; ++k){
                    int idx = lower_bound(dp, dp+p, arr[k]) - dp;
                    if(idx == p) p++;
                    dp[idx] = arr[k];
                }
                ans = max(ans, p);
            }
            for(int j = i; j<n; ++j){
                arr[j] = dq.front();
                dq.pop_front();
            }
        }
    }
    cout << ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2660 KB Output is correct
2 Correct 9 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2688 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2652 KB Output is correct
10 Correct 10 ms 2652 KB Output is correct
11 Correct 31 ms 2652 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2660 KB Output is correct
2 Correct 9 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2688 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2652 KB Output is correct
10 Correct 10 ms 2652 KB Output is correct
11 Correct 31 ms 2652 KB Output is correct
12 Correct 901 ms 2904 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Execution timed out 2035 ms 2652 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2660 KB Output is correct
2 Correct 9 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2688 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2652 KB Output is correct
10 Correct 10 ms 2652 KB Output is correct
11 Correct 31 ms 2652 KB Output is correct
12 Correct 901 ms 2904 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Execution timed out 2035 ms 2652 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3420 KB Output is correct
2 Correct 26 ms 3416 KB Output is correct
3 Correct 27 ms 3420 KB Output is correct
4 Correct 27 ms 3420 KB Output is correct
5 Correct 15 ms 3420 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2045 ms 2672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2025 ms 2792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2660 KB Output is correct
2 Correct 9 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 9 ms 2688 KB Output is correct
5 Correct 5 ms 2652 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 19 ms 2652 KB Output is correct
10 Correct 10 ms 2652 KB Output is correct
11 Correct 31 ms 2652 KB Output is correct
12 Correct 901 ms 2904 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Execution timed out 2035 ms 2652 KB Time limit exceeded
15 Halted 0 ms 0 KB -