제출 #1195473

#제출 시각아이디문제언어결과실행 시간메모리
1195473adriines06Bulldozer (JOI17_bulldozer)C++20
0 / 100
0 ms324 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; void solve(){ int n; cin>>n; vector<pair<int,int>>c(n); vector<int>w(n); for(int i=0;i<n;i++){ cin>>c[i].first>>c[i].second>>w[i]; } ll ans=0,s=0; for(int i=0;i<n;i++){ for(int j=i;j<n;j++){ s+=w[j]; ans=max(ans,s); } s=0; } cout<<ans; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...