# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
629270 | 2022-08-14T10:20:52 Z | handlename | 메기 농장 (IOI22_fish) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> //#include "fish.h" using namespace std; #define pb push_back #define mp make_pair long long dp[3005][3005][2]; //col,height,increasing/decreasing long long pre[3005][3005]; long long max_weights(int n,int m,vector<int> x,vector<int> y,vector<int> w){ for (int i=0;i<m;i++){ x[i]++; y[i]++; pre[x[i]][y[i]]=w[i]; } for (int i=1;i<=n;i++){ for (int j=1;j<=n;j++){ pre[i][j]+=pre[i][j-1]; } } for (int i=1;i<=n;i++){ //col for (int j=0;j<=n;j++){ //col height dp[i][j][0]=-1e18; dp[i][j][1]=-1e18; } long long maxi=0; for (int j=0;j<=n;j++){ maxi=max(maxi,dp[i-1][j][0]-pre[i][j]-pre[i-1][j]); if (i>=2){ maxi=max(maxi,dp[i-2][j][1]-pre[i-1][j]); } dp[i][j][0]=maxi+pre[i-1][j]+pre[i+1][j]; } maxi=0; if (i>=2){ for (int j=n;j>=0;j--){ maxi=max(maxi,dp[i-2][k][1]); dp[i][j][0]=max(dp[i][j][0],maxi+pre[i+1][j]); } } /* for (int j=0;j<=n;j++){ if (i>=2){ for (int k=j;k<=n;k++){ //i-2 col height dp[i][j][0]=max(dp[i][j][0],dp[i-2][k][1]+pre[i+1][j]); } } } * */ for (int j=0;j<=n;j++){ //calculate decreasing for (int k=j;k<=n;k++){ //prev col height dp[i][j][1]=max(dp[i][j][1],dp[i-1][k][1]); } dp[i][j][1]+=pre[i+1][j]-pre[i][j]; } for (int j=0;j<=n;j++){ dp[i][j][1]=max(dp[i][j][1],dp[i][j][0]); } } long long ans=0; for (int j=0;j<=n;j++){ ans=max(ans,dp[n][j][1]); } return ans; }