oj.uz

답안 #497630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497630 2021-12-23T12:13:42 Z tmn2005 금 캐기 (IZhO14_divide) C++17
0 / 100
 0 ms 312 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b[N],c[N];

main(){
	NeedForSpeed
    cin>>n;
    for(int i=1; i<=n; i++){
    	cin>>a[i]>>b[i]>>c[i];
	}
	x = a[1];
	res += b[1];
	ans += c[1];
	k   += 0;
	l = 1;
	for(int i=2; i<=n; i++){
		res += b[i];
		ans += c[i];
		k   += (a[i] - a[i-1]);
		
		while(k > ans && l <= n){
			res -= b[l];
			ans -= c[l];
			k = a[i] - a[l+1];
			l++;
		}
		r = max(r, res);
	}
	cout<<r;



	return 0;
}

Compilation message

divide.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -