Submission #497660

#	Time	Username	Problem	Language	Result	Execution time	Memory
497660		Aktan	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1026 ms	3144 KiB

divide

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define ft first
#define sc second
using namespace std;
const int mod=1e9+7,INF=1e17;

int a[100005],b[100005],c[100005],dp[100005],dp1[100005];
main(){
   int n,ans=0,res=0;
   cin >> n;
   for(int i=1;i<=n;i++){
   	cin >> a[i] >> b[i] >> c[i];
	   	dp[i]=dp[i-1]+b[i];
	   	dp1[i]=dp1[i-1]+c[i];
   	ans+=b[i];
   }
   int tot=0;
   for(int i=1;i<=n;i++){
   	for(int j=i;j<=n;j++){
   		int k=a[j]-a[i];
   		if(dp1[j]-dp1[i-1]>=k){
   			tot=max(tot,dp[j]-dp[i-1]);
		}
	   }
   }
   cout << tot;
   
}

Compilation message (stderr)

divide.cpp:13:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   13 | main(){
      | ^~~~
divide.cpp: In function 'int main()':
divide.cpp:14:16: warning: unused variable 'res' [-Wunused-variable]
   14 |    int n,ans=0,res=0;
      |                ^~~

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