제출 #718812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718812		Ahmed57	새로운 문제 (POI11_pio)	C++14	0 / 100	1072 ms	65536 KiB

pio

#include <bits/stdc++.h>
using namespace std ;
#define int long long
int logg[500001];
int table[500001][20];
int qu(int l,int r){
    int ge = logg[r-l+1];
    return max(table[l][ge],table[r-(1<<ge)+1][ge]);
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;cin>>n;
    int arr[n];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        table[i][0] = arr[i];
    }
    logg[1] = 0;
    for(int i = 1;i<=n;i++)logg[i] = logg[i/2]+1;
    for(int j = 1;j<20;j++){
        for(int i = 0;i<n;i++){
            if(i+(1<<j)<=n){
                table[i][j] = max(table[i][j-1],table[i+(1<<(j-1))][j-1]);
            }
        }
    }
    for(int i = 0;i<n;i++){
        int st = i+1,len = 1;
        int all =arr[i] ;
        while(st<n){
            int en = min(n-1,i+(len*len));
            all = max(all,qu(st,en)+len);
            st = en+1;len++;
        }
        st = i-1;len = 1;
        while(st>=0){
            int en = max(0LL,i-(len*len));
            all = max(all,qu(en,st)+len);
            st = en-1;len++;
        }
        cout<<all-arr[i]<<endl;
    }
    return 0 ;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10