#include #include #define  N 1000010 #define inf 9999999 int dp[N], pre[N], num[N], max; int Max(int a, int b) {     return a > b ? a : b; } int main() {     int i, j;     int n, m;   while(scanf("％d％

#include"iostream"// 很神奇的是如果全是负数不用单独考虑，也可AC #include"stdio.h" #include"algorithm" using namespace std;   int a[100005];   int main() {     int num,n,begin,end,sum,max,mark,i;     int count=0;     s

#include"iostream"// 很神奇的是如果全是负数不用单独考虑，也可AC #include"stdio.h" #include"algorithm" using namespace std; int a[100005]; int main() { int num,n,begin,end,sum,max,mark,i; int count=0; scanf("%d",&num);

#include"iostream" #include"stdio.h" #include"algorithm" using namespace std; #define MAXN 32 struct NODE { int l,w,h,s; }node[MAXN*3]; int dp[MAXN*3]; bool cmp(NODE a,NODE b) { return a.l*a.w>b.l*b.w

http://www.cnblogs.com/183zyz/archive/2011/10/14/2212034.html

#include"iostream" #include"string.h" using namespace std; int min (int a, int b) {     return a } int main() {     int i,num;     int dp[105][2];     char str[105];     scanf("%d",&num);     while(nu

#include"iostream" #include"stdio.h" #include"algorithm" #include"string" using namespace std; int main() { int zuo,fanzhuan,i,len,count=1; string a; while(cin>>a) { if(a[0]=='-') break; zuo=0; fanzhu