Submission #170735

#TimeUsernameProblemLanguageResultExecution timeMemory
170735juggernaut금 캐기 (IZhO14_divide)C++14
48 / 100
1086 ms3704 KiB
//Just try and the idea will come! #include<bits/stdc++.h> #define int long long int using namespace std; struct data{ int x,g,d; }; data a[100001]; int n,i,drive[100001],gold[100001],vec[100001],res,j; main(){ scanf("%lld",&n); for(i=1;i<=n;i++){ scanf("%lld%lld%lld",&a[i].x,&a[i].g,&a[i].d); gold[i]=gold[i-1]+a[i].g; drive[i]=drive[i-1]+a[i].d; vec[i]=drive[i]-a[i].x; } for(i=1;i<=n;i++){ for(j=i;j<=n;j++){ if(vec[j]>=drive[i-1]-a[i].x)res=max(res,gold[j]-gold[i-1]); } } cout<<res; }

Compilation message (stderr)

divide.cpp:10:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
divide.cpp: In function 'int main()':
divide.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&n);
     ~~~~~^~~~~~~~~~~
divide.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&a[i].x,&a[i].g,&a[i].d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...