POJ （简单 dp ，最长升序子串）

POJ 1533

题意：求输入的一串数字的最长升序子串的长度。

#include<iostream>
#include<cstring>
#include<cstdio>

#define M 1005

using namespace std;

int s[M];
int maxn[M];

int main()
{
int n;
cin>>n;
for(int i = 1;i <= n; i++)
cin>>s[i];

maxn[1] = 1;

for(int i = 2;i <= n; i++){
int temp = 0;

for(int j = 1;j < i; j++)
if(s[i] > s[j] && maxn[j] > temp){
temp = maxn[j];
}
maxn[i] = temp + 1;
}
int ans = -1;
for(int i = 1;i <= n; i++)
if(maxn[i] > ans)
ans = maxn[i];

cout<<ans<<endl;
return 0;
}

异曲同工的题：POJ 2593

#include<iostream>
#include<cstdio>

#define Min -9999999

using namespace std;

int lef[100005];
int inter[100005];

int main()
{
// freopen("in.txt","r",stdin);

int n;
while(scanf("%d",&n) != EOF && n){

int sum = 0,temp = Min;
for(int i = 1;i <= n; i++){
scanf("%d",&inter[i]);
sum += inter[i];
if(sum > temp)
temp = sum;
lef[i] = temp;
if(sum < 0)
sum = 0;
}
sum = 0;
int ans = Min;
temp = Min;
for(int i = n;i > 1; i--){

sum += inter[i];
if(temp < sum)
temp = sum;
if(ans < temp + lef[i-1])
ans = temp + lef[i-1];
if(sum < 0)
sum = 0;
}
cout<<ans<<endl;
}
return 0;
}