dp [i][j][0] 从i 到 j 的有多少1结尾的非递增子序列 ( 21 或 1 )
dp [i][j][1] 从i 到 j 的有多少2结尾的非递增子序列 只有2
处理一下 多少个1 多少个 2 ,就可以get
C. A Twisty Movement
A dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day, people model a dragon with bamboo strips and clothes, raise them with rods, and hold the rods high and low to resemble a flying dragon.
A performer holding the rod low is represented by a 1, while one holding it high is represented by a 2. Thus, the line of performers can be represented by a sequence a1, a2, ..., an.
Little Tommy is among them. He would like to choose an interval [l, r] (1 ≤ l ≤ r ≤ n), then reverse al, al + 1, ..., ar so that the length of the longest non-decreasing subsequence of the new sequence is maximum.
A non-decreasing subsequence is a sequence of indices p1, p2, ..., pk, such that p1 < p2 < ... < pk and ap1 ≤ ap2 ≤ ... ≤ apk. The length of the subsequence is k.
The first line contains an integer n (1 ≤ n ≤ 2000), denoting the length of the original sequence.
The second line contains n space-separated integers, describing the original sequence a1, a2, ..., an (1 ≤ ai ≤ 2, i = 1, 2, ..., n).
Print a single integer, which means the maximum possible length of the longest non-decreasing subsequence of the new sequence.
4 1 2 1 2
4
10 1 1 2 2 2 1 1 2 2 1
9
In the first example, after reversing [2, 3], the array will become [1, 1, 2, 2], where the length of the longest non-decreasing subsequence is 4.
In the second example, after reversing [3, 7], the array will become [1, 1, 1, 1, 2, 2, 2, 2, 2, 1], where the length of the longest non-decreasing subsequence is 9.
#include<iostream> #include<algorithm> using namespace std; typedef long long ll; #define f(i,l,r) for(int i=l;i<=r;i++) #define g(i,l,r) for(int i=l;i>=r;i--) const int maxn = 2005 ; int a[maxn],b[maxn],c[maxn], n,ans= -2147483647; int dp[maxn][maxn][2]; int main() { cin>>n; f(i,1,n)cin>>a[i]; f(i,1,n) b[i]=b[i-1]+(a[i]==1); g(i,n,1) c[i]=c[i-1]+(a[i]==2) ; f(i,1,n) { f(j,1,n) { dp[i][j][0]=dp[i][j-1][0]+(a[i]==1); dp[i][j][1]=max(dp[i][j-1][1],d[i][j-1][0])+(a[i]==2); ans=max(ans,dp[i][j][0]+b[i-1]+c[j+1]); ans=max(ans,dp[i][j][1]+b[i-1]+c[j+1]); } } cout<<ans<<endl; return 0; }
return 0;
}
未来的我一定会感谢现在正在成长的我