u010652938的专栏

#include #include #include #include #include #include #define maxn 250*250 + 10#define ll long long#define INF 1000000000#define FOR(i, a, b) for(int i = a; i < b; ++i)using namespace std;i

书上的递推式是  f(i,j) = max(f(i, k), f(k, j)

/************************************************************************* > File Name: vj.cpp > Author: bxf > Mail: bbb546754186@vip.qq.com > Created Time: 2014年08月04日 星期一 19时35分22秒

#include #include #include #include #include #include #include #include #include #include #include #include #include #define maxn 100 + 10#define INF 0x7fffffffusing namespace std;char

D. Count Good Substringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe call a string good, if after merging all

#include #include #include #include #include #include #include #include #include #include using namespace std;#define maxn 30000 + 10#define INF 2100000000#define ll long longint v[8] =

#include #include #include #include #include #include #include #include #include #include using namespace std;#define maxn 10000 + 10#define ll long long#include int n, a[maxn], in[maxn]

#include #include #include #include #include #include #define maxn 1000 + 10#define ll long long#define INF 1000000000#define FOR(i, a, b) for(int i = a; i < b; ++i)using namespace std;int

#include #include #include #include #include #include #define maxn 100 + 10#define ll long long#define INF 1000000000#define FOR(i, a, b) for(int i = a; i using namespace std;boo

约瑟夫环问题。把第一个去掉，应该找的13就变成了11。#includeusing namespace std;int main(){ int n; while(cin>>n&&n) { int i,j,x; for(i=1;i<n-1;i++) { x=0; for(j=1;j<n;j++)

#include #include #include #include using namespace std;int n, a[1000000];int main(){ int i, min, max, sum, count; while(cin >> n) { for(int i = 0; i < n; i ++)

刚做这个题的时候，dp(i,j)下疳