제출 #1166026

#제출 시각아이디문제언어결과실행 시간메모리
1166026LmaoLmaoK blocks (IZhO14_blocks)C++20
0 / 100
1 ms584 KiB
#include<bits/stdc++.h> #define fi first #define se second #define int long long using namespace std; using ll = long long; using ii = pair<ll, ll>; using aa = array<int,3>; const int N = 1e6+5; const int INF = 1e9; int dp[100005][105]; int op[100005][105]; int a[100005]; int tshirt(int L,int R,int cur) { int l=L,r=R; int res=dp[l][cur]; if(L==R) return res; while(l<=r) { int m=(l+r)/2; if(m==L) { if(dp[m][cur]>dp[m+1][cur]) { l=m+1; } else return dp[m][cur]; } else if(m==R) { if(dp[m][cur]>dp[m-1][cur]) { r=m-1; } else return dp[m][cur]; } else if(dp[m][cur]<=dp[m+1][cur] && dp[m][cur]<=dp[m-1][cur]) { return dp[m][cur]; } if(dp[m][cur]>dp[m+1][cur]) { l=m+1; } else { r=m-1; } } } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n,k; cin >> n >> k; for(int i=1;i<=n;i++) { cin >> a[i]; dp[i][0]=1e18; } for(int j=1;j<=k;j++) { stack<int> st; dp[j-1][j]=1e18; op[j-1][j]=1e18; for(int i=j;i<=n;i++) { if(i<j) { cout << -1 << ' '; continue; } while(!st.empty() && a[i]>=a[st.top()]) { st.pop(); } int pos; if(st.empty()) { dp[i][j]=op[i-1][j-1]+a[i]; } else { pos=st.top(); dp[i][j]=min(tshirt(pos,i-1,j-1)+a[i],dp[pos][j]); } st.push(i); //cout << pos << ' '; //cout << dp[i][j] << ' '; op[i][j]=min(op[i-1][j],dp[i][j]); } //cout << endl; } cout << dp[n][k]; return 0; }

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

blocks.cpp: In function 'long long int tshirt(long long int, long long int, long long int)':
blocks.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...