HDU 1003Max Sum
2016-04-21 18:56
288 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1003题目很hdu1031一样状态转移方程dp[i]=max(a[i],dp[i-1]+a[i]) 思路一样。#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
///dp[i]=max(a[i],dp[i-1]+a[i])
int dp[100005],a[100005];
int k,s,e,x;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;cin>>n;
for(int j=1;j<=n;j++)
{
cle(a);
int num=0;
cin>>k;
for(int i=1;i<=k;i++)
{
scanf("%d",&a[i]);
}
s=e=x=1;
int Max=a[1];
cle(dp);///dp[i]=max(dp[i-1]+a[i],a[i]);
for(int i=1;i<=k;i++)
{
if(0>dp[i-1]){dp[i]=a[i],x=i;}
else dp[i]=dp[i-1]+a[i];
if(Max<dp[i]){Max=dp[i],s=x,e=i;}
}
cout<<"Case "<<j<<":"<<endl;
cout<<Max<<" "<<s<<" "<<e<<endl;
if(j!=n)cout<<endl;
}
return 0;
}
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
///dp[i]=max(a[i],dp[i-1]+a[i])
int dp[100005],a[100005];
int k,s,e,x;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;cin>>n;
for(int j=1;j<=n;j++)
{
cle(a);
int num=0;
cin>>k;
for(int i=1;i<=k;i++)
{
scanf("%d",&a[i]);
}
s=e=x=1;
int Max=a[1];
cle(dp);///dp[i]=max(dp[i-1]+a[i],a[i]);
for(int i=1;i<=k;i++)
{
if(0>dp[i-1]){dp[i]=a[i],x=i;}
else dp[i]=dp[i-1]+a[i];
if(Max<dp[i]){Max=dp[i],s=x,e=i;}
}
cout<<"Case "<<j<<":"<<endl;
cout<<Max<<" "<<s<<" "<<e<<endl;
if(j!=n)cout<<endl;
}
return 0;
}
相关文章推荐
- HDU 1231最大连续子序列
- HDU 2946 Letter Cookies
- HDU 1864最大报销额
- 链队列的综合操作(详解、演示)C语言实现
- 文件加密
- 用while随机求十个数的和
- 慎用mutableCopy
- HDU 2955 Robberies
- CF 275A. Counterexample
- CF 275B. Friends and Presents
- 01 背包问题
- CF 269B
- HDU 2952 Counting Sheep
- hiho #1015 : KMP算法
- UVa11729 Commando War
- JZOJ4446【HNOI模拟】B
- Qt(QLabel)实现滚动字幕
- UVa-11292 -Dragon of Loowater
- UVa100 The 3n + 1 problem
- #261B. Pashmak and Flowers