제출 #930988

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
930988		thunopro	Gap (APIO16_gap)	C++14	0 / 100	36 ms	5668 KiB

gap

#include<bits/stdc++.h>
#include "gap.h"
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int findGap ( int type , int n ) 
{
	if ( type == 1 ) 
	{
		vector<ll> a (n+1) ; 
		ll s = 0 , t = 1e18 ; 
		for ( int l = 0 , r = n-1 ; l <= r ; ++ l , -- r ) 
		{
			MinMax (s,t,&a[l],&a[r]) ; 
			s = a [l] + 1 , t = a [r] - 1 ; 
		}
		ll res = 0 ; 
		for ( int i = 1 ; i < n ; i ++ ) chkmax (res,a[i]-a[i-1]) ;
		cout << res << "\n" ; 
	}
}
//int main () 
//{
//	ios_base::sync_with_stdio(0); 
//	cin.tie(0);cout.tie(0); 
//	rf () ; 
//}

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'int findGap(int, int)':
gap.cpp:58:1: warning: no return statement in function returning non-void [-Wreturn-type]
   58 | }
      | ^
gap.cpp: In function 'void rf()':
gap.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70