제출 #1308419

#제출 시각아이디문제언어결과실행 시간메모리
1308419thnhannMizuyokan 2 (JOI23_mizuyokan2)C++20
컴파일 에러
0 ms0 KiB
//#pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC target("avx,avx2,fma,lzcnt,popcnt") #include <bits/stdc++.h> #define ll long long #define fi first #define se second #define pb push_back #define ii pair<int,int> #define ill pair<ll,ll> #define el cout<<'\n' #define int long long const ll mod=1e9+7; const int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; const int nmax=5e5; const int inf =2e9; void add(int &a, int b) { a += b; if (a >= mod) a -= mod; if (a < 0) a += mod; } template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;} template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;} using namespace std; mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); int rand(int l, int r) { return uniform_int_distribution<int>(l, r) (rd); } int n; int d[nmax + 5]; int q; int len[nmax + 5]; int dp[nmax + 5]; int pre[nmax + 5]; signed main() { ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin >> n; for(int i=1;i<=n;i++) { cin >> d[i]; } cin >> q; while(q--) { int x,y,l,r; cin >> x >> y >> l >> r; d[x] = y; int m = 0; for(int i=l + 1;i <= r;i++) len[++m] = d[i]; pre[0] = 0; for(int i=1;i<=m;i++) pre[i] = pre[i - 1] + len[i]; int ans = 1; if (m == 0) ans = 0; for(int i=1; i<=m; i++) dp[i] = 0; dp1] = 1; for(int i=2; i<=m; i++) { for(int j=1; j<i; j++) { int sum = pre[i-1] - pre[j]; if (sum > len[j]) { ans = max(ans, dp[j] + 1); if (sum > len[i]) { dp[i] = max(dp[i], dp[j] + 2); ans = max(ans, dp[i]); } } } } cout << ans; el; } } // "Can i get a kiss? And can u make it last forever?"

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

mizuyokan2.cpp: In function 'int main()':
mizuyokan2.cpp:72:9: error: 'dp1' was not declared in this scope; did you mean 'dp'?
   72 |         dp1] = 1;
      |         ^~~
      |         dp