제출 #1167309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167309		Almonther	Divide and conquer (IZhO14_divide)	C++20	17 / 100	0 ms	328 KiB

divide

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define co cout<<
// stuff
struct smth{
    ll last,ans,extra;
};
void solve(){
    ll n;
    cin>>n;
    smth ans[n+5];
    ll cords[n+5];
    ll mx=0;
    for(int i=0;i<n;i++){
        cin>>cords[i]>>ans[i].ans>>ans[i].extra;
        ans[i].last=i;
        while(ans[i].last!=0){
            if(cords[ans[i].last]-cords[ans[i].last-1]<=ans[i].extra+ans[ans[i].last-1].extra){
                ans[i].extra-=cords[ans[i].last]-cords[ans[i].last-1];
                ans[i].ans+=ans[ans[i].last-1].ans;
                ans[i].extra+=ans[ans[i].last-1].extra;
                ans[i].last=ans[ans[i].last-1].last;
            }
            else break;
        }
        mx=max(mx,ans[i].ans);
    }
    co mx;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int _=1;
    // cin>>_;
    while(_--) solve();
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52