#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define ll long long
#define ff first
#define ss second
using namespace std;
const int MAX = 25;
int A[MAX],B[MAX],C[MAX];
pair<int,int>dp[(1<<21)+5];
void go(){
int n; cin>>n;
for(int i=0;i<n;i++){
cin>>A[i]>>B[i]>>C[i];
}
ll ans=0;
for(int i=0;i<n;i++){
int pos=A[i];
ll sum=B[i];
int ener=C[i];
for(int j=i+1;j<n;j++){
if(ener+C[j]>=abs(pos-A[j])){
ener+=C[j];
ener-=abs(A[i]-A[j]);
sum+=B[j];
pos=A[j];
}
else{
break;
}
}
ans=max(ans,sum);
}
cout<<ans<<endl;
}
int main(){
fastio;
go();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |