hdu 1087dp

来源：互联网发布：淘宝兼职软件编辑：程序博客网时间：2024/06/05 16:43

2014/9/12

自己撸的代码跪了。。

#include<stdio.h>#include<string.h>#include<cmath> #include<algorithm>#include<iostream>#include<queue>#include<stack>#include<map>#include<climits>#include<vector>using namespace std;typedef long long ll;  #define f(x,y,i) for(int i = x;i < y; i++)#define ff(x,y,i) for(int i = x;i  <= y; i++)#define F(x,y,i) for(int i = x; i >= y; i--)#define FF(x,y,i) for(int i = x; i > y; i++)#define lson pos<<1,l,mid#define rson pos<<1|1,mid+1,r#define Min(x,y) x<y?x:y#define Max(x,y) x>y?x:y#define sc(n) scanf("%d",&n)#define pr(n) printf("%d\n",n)#define met(n,m) memset(n, m, sizeof(n)) #define mod 10007const int N=1050;int n , tot ,m , k;__int64 s[N]; __int64 dp[N], maxn,sum;int main(){   while(~scanf("%d",&n)&&n)   {   int temp = 0;   met(dp,0);   f(0,n,i)   {   scanf("%I64d",&s[i]);   }  sum  =0;   for(int i = 0;i < n; i++)   {   maxn = 0;   for(int j = 0;j < i; j++)   {   if(s[j] < s[i]&&dp[j]>maxn)   {   maxn=dp[j];   }   }   dp[i]=s[i]+maxn;   sum=sum > dp[i]?sum:dp[i];   }                           printf("%I64d\n",sum);   }                        return 0;}

0 0