This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
int x[N], g[N], e[N];
int main(){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
x[i] = a, g[i] = b, e[i] = c;
}
ll answer = 0;
for(int i = 1; i <= n; ++i)
for(int j = i+1; j <= n; ++j){
int len = x[j]-x[i];
// len is needed energy
ll sm = 0, sm1 = 0;
for(int k = i; k <= j; ++k)
sm += g[k], sm1 += e[k];
if(sm1 >= len)
umax(answer, sm);
}
if(answer == 0){
int mx = 0;
for(int i = 1; i <= n; ++i)
umax(mx, g[i]);
answer = mx;
}
printf("%lld\n", answer);
return 0;
}
Compilation message (stderr)
divide.cpp: In function 'int main()':
divide.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
20 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
divide.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
23 | scanf("%d%d%d", &a, &b, &c);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |