Submission #1051803

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1051803	2024-08-10 09:53:14	fryingduc	Watching (JOI13_watching)	C++17	100 / 100	340 ms	30520 KiB

watching

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int maxn = 2005;
int n, a[maxn], p, q;
bool check(int mid) {
    vector<vector<int>> f(n + 1, vector<int>(p + 2, 1e9));
    for(int i = 0; i <= p + 1; ++i) {
        f[0][i] = 0;
    }
    int pl = 0, pr = 0;
    for(int i = 1; i <= n; ++i) {
        while(pl < i and a[i] - mid + 1 > a[pl]) ++pl;
        while(pr < i and a[i] - mid * 2 + 1 > a[pr]) ++pr;
        if(a[pl] >= a[i] - mid + 1 and pl) --pl;
        if(a[pr] >= a[i] - mid * 2 + 1 and pr) --pr;
        
        for(int j = 0; j <= p; ++j) {
            f[i][j] = f[pr][j] + 1;
            if(j) f[i][j] = min(f[i][j], f[pl][j - 1]);
        }
    }
    
    int ans = 1e9;
    for(int i = 0; i <= p; ++i) {
        ans = min(ans, f[n][i]);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50