HDU 1003
来源:互联网 发布:淘宝宝贝促销加权重么 编辑:程序博客网 时间:2024/06/07 00:27
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[100005];
int a[100005];
int num = 1;
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
memset(dp, 0, sizeof(dp));
int n;
int start=1, end=1;
int maxx = -1001;
scanf("%d", &n);
for (int i = 1; i <=n ; i++)
{
scanf("%d", &a[i]);
dp[i] = max(a[i], dp[i-1] + a[i]);
if (dp[i] > maxx){ maxx = dp[i]; end = i; }
}
int sum = 0;
for (int i = end; i >= 1; i--)
{
sum += a[i];
if (sum == maxx){ start = i; break; }
}
printf("Case %d:\n", num++);
printf("%d %d %d\n", maxx, start, end);
if (t)printf("\n");
}
}
#include<string.h>
#include<algorithm>
using namespace std;
int dp[100005];
int a[100005];
int num = 1;
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
memset(dp, 0, sizeof(dp));
int n;
int start=1, end=1;
int maxx = -1001;
scanf("%d", &n);
for (int i = 1; i <=n ; i++)
{
scanf("%d", &a[i]);
dp[i] = max(a[i], dp[i-1] + a[i]);
if (dp[i] > maxx){ maxx = dp[i]; end = i; }
}
int sum = 0;
for (int i = end; i >= 1; i--)
{
sum += a[i];
if (sum == maxx){ start = i; break; }
}
printf("Case %d:\n", num++);
printf("%d %d %d\n", maxx, start, end);
if (t)printf("\n");
}
}
阅读全文
0 0
- HDU-1231&HDU-1003
- HDU 1003
- hdu 1003
- hdu 1003
- HDU 1003
- HDU 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- hdu 1003
- HDU-1003
- HDU 1003
- hdu 1003
- HDU 1003
- mysql substr()函数
- 学习笔记之sql备忘录
- [JZOJ5388]博弈
- js中什么是事件气泡,如何阻止事件气泡
- Android调节屏幕亮度
- HDU 1003
- 周中记录--2017.9.28
- Android学习笔记15---拖动条的实现
- Codeforces Round #436 (Div. 2) 864E. Fire
- Apache用户登录认证和虚拟主机
- JAVA设计模式之工厂模式(简单工厂模式+工厂方法模式)
- css图形旋转
- 【Spring】Quartz和Task实现定时任务
- hadoop内的各种join