DTOGRADA - Sơn tường

Tác giả: RR

Ngôn ngữ: C++

#include <iostream>
#include <algorithm>
#define FOR(i,a,b)  for(int i=a; i<=b; i++)
#define FORD(i,a,b) for(int i=a; i>=b; i--)
#define MAXN 1100111
using namespace std;

int debug=0;
//Buffer reading
int INP,AM;
#define BUFSIZE (1<<10)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        fread(BUF,1,BUFSIZE,stdin); \
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//Buffer reading

int n,x,a[MAXN],l[MAXN],r[MAXN],last[MAXN],h[MAXN];

void input() {
    GN(n); GN(x);
    FOR(i,1,n) GN(a[i]);
    while (n%x) {
        n++;
        a[n]=0;
    }
}

void init() {
    FOR(i,0,n/x-1) {
        int u=i*x+1;
        l[u]=a[u];
        u+=x-1;
        r[u]=a[u];
    }
    
    FOR(i,1,n)
        if (!l[i]) l[i]=min(l[i-1],a[i]);
    FORD(i,n,1)
        if (!r[i]) r[i]=min(r[i+1],a[i]);
        
    if (debug) {
        FOR(i,1,n) cout<<l[i]<<" "; cout<<endl;
        FOR(i,1,n) cout<<r[i]<<" "; cout<<endl;
    }
}

void solve() {
    FOR(i,x,n)
        last[i]=min(l[i],r[i-x+1]);
    
    memset(l,-1,sizeof l);
    memset(r,-1,sizeof r);
    
    FOR(i,0,n/x-1) {
        int u=i*x+1;
        l[u]=last[u];
        u+=x-1;
        r[u]=last[u];
    }
    
    if (debug) {
        FOR(i,1,n) cout<<last[i]<<" "; cout<<endl;
    }
    
    FOR(i,1,n)
        if (l[i]==-1) l[i]=max(l[i-1],last[i]);
    FORD(i,n,1)
        if (r[i]==-1) r[i]=max(r[i+1],last[i]);
        
    long long res=0LL;
    FOR(i,1,n) h[i]=max(l[i+x-1],r[i]);
    if (debug) {
        cout<<endl;
        FOR(i,1,n) cout<<l[i]<<" "; cout<<endl;
        FOR(i,1,n) cout<<r[i]<<" "; cout<<endl;
        FOR(i,1,n) cout<<h[i]<<" "; cout<<endl;
        cout<<endl;
    }
    FOR(i,1,n) res+=a[i]-h[i];
    cout<<res<<endl;
    
    int cnt=0,u=h[n],ok=n+1;
    FORD(i,n,1)
    if (a[i])
    if (i<ok || h[i]!=u) {
        cnt++;
        u=h[i]; ok=i-x+1;
    }
    cout<<cnt;
}

int main() {
    input();
    init();
    solve();
    return 0;
}

Download