摘要： /* ID:chenjiong PROG:numtri LANG:C++*/#include <stdio.h>#include <string.h>const int MAXN = 1005;int N;int mat[MAXN][MAXN];int dp[MAXN][MAXN];int ans;int max(int x,int y){ return x > y ? x : y;}void solve(){ dp[0][0] = mat[0][0]; int i,j; for ( i = 1; i < N; i++) { dp[... 阅读全文

摘要： /* ID:chenjiong PROG:numtri LANG:C++*/#include <stdio.h>#include <string.h>const int MAXN = 1005;int N;int mat[MAXN][MAXN];int cnt;int sum;int max = 0;void dfs(int x,int y){ if ( x == N ) { if ( sum > max ) max = sum; return; } sum += mat[x + 1][y]; d... 阅读全文

摘要： /* ID:chenjiong PROG:ariprog LANG:C++*/#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int MAXN = 250;typedef struct { int a; int d;}ARIPROG;bool is_bisquare[2 * MAXN * MAXN + 1];int bisquare[( MAXN + 1 ) * ( MAXN + 1 )];int cnt = 0;int N,M;int u_ 阅读全文