摘要： 1 3 1 2 32 6 -1 4 -2 3 -2 34 6 -1 4 -2 3 -2 3#include <stdio.h>#include <string.h>#define N 1000005int dp[N][N];int num[N];int t[2][N];int n , m ;int max(int a ,int b){return a>b?a:b;}int not(int i){return i==1?0:1;}int main(){int i , j , k ;while(scanf("%d %d",&m,&n 阅读全文