oj.uz

답안 #832947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832947 2023-08-21T17:02:03 Z CSQ31 Feast (NOI19_feast) C++17
0 / 100
 19 ms 3668 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 2e5+5;
const ll INF = 1e18;
int n,k;
ll a[MAXN],dp[MAXN];
ll find(ll x){
	for(int i=1;i<=n;i++)dp[i] = INF;
	vector<int>seg(n+1,0);
	dp[0] = 0;
	ll mx = 0;
	int cur = 0;
	for(int i=1;i<=n;i++){
		dp[i] = a[i] + mx - x;
		seg[i] = cur+1;
		
		if(dp[i-1] > dp[i]){
			dp[i] = dp[i-1];
			seg[i] = seg[i-1];
		}
		if(dp[i] - a[i] == mx)cur = max(cur,seg[i]);
		else if(dp[i] - a[i] > mx){
			mx = dp[i] - a[i];
			cur = seg[i];
		}
		
	}
	//cout<<x<<" "<<seg[n]<<'\n';
	return seg[n];
}
int main()
{
	owo
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i]+=a[i-1];
	}
	ll l = -1e15,r = 1e15;
	while(r>l){
		ll m = (l+r+1)/2;
		if(find(m) < k)r = m-1;
		else l = m;
	}
	find(r);
	cout<<dp[n] + k*1LL*r;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 3668 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

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