Submission #497645

#TimeUsernameProblemLanguageResultExecution timeMemory
497645AktanDivide and conquer (IZhO14_divide)C++17
0 / 100
0 ms288 KiB
#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]; main(){ int n; cin >> n; for(int i=0;i<n;i++){ cin >> a[i] >> b[i] >> c[i]; } int l=0,r=0,dist=0,ans=0,res=0,tot=0; while(r<n){ tot+=c[r]; ans+=b[r]; if(r==0){ r++; continue; } else{ while(a[r]-a[l]>tot){ tot-=c[l]; ans-=b[l]; l++; } } res=max(res,ans); r++; } cout << res; }

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:19:16: warning: unused variable 'dist' [-Wunused-variable]
   19 |    int l=0,r=0,dist=0,ans=0,res=0,tot=0;
      |                ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...