Submission #1188370

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188370		al_reem_2010	Divide and conquer (IZhO14_divide)	C++20	48 / 100	1095 ms	1608 KiB

divide

// اَللَهُمَ صَلِ عَلَىَ مُحَمَدٍ وَ آلِ مُحَمَدٍ
#include "bits/stdc++.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <thread>
#include <fstream>
using namespace std ;
#define int long long
#define pb push_back
#define si size()
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define applejuice ios::sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
const int inf=1e18 ;
const int mod=1e9+7 ;
int tt=1 ;
int x[100007] , preg[100007] , pred[100007] ;
void solve()
{
    int n , ans=-inf ;
    cin >> n ;
    for(int i=1 ; i<=n ; i++) {int g , d ; cin >> x[i] >> g >> d ; preg[i]=g+preg[i-1] ; pred[i]=d+pred[i-1] ;}
    for(int i=0 ; i<n ; i++)
    {
        for(int j=1 ; j<=n-i ; j++)
        {
            if(pred[j+i]-pred[j-1]>=x[j+i]-x[j]) {ans=max(preg[j+i]-preg[j-1],ans) ;}
        }
    }
    cout << ans ;
}
signed main() 
{
    //wrong
    applejuice ;
    //cin >> tt ;
    while(tt--) {solve();}
}
/*
 4
 0 5 1
 1 7 2
 4 4 1
 7 15 1
 
 2
 0 4 1
 3 5 1
 */

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