Cod sursa(job #759549)
Utilizator | test13 test13 | Data | 18 iunie 2012 16:57:58 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int main(){
int best,p,u,best1,p1,x;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
scanf("%d",&x); // read first value
best = best1 = x; p = u = p1 = 1;
for(int i=2;i<=n;i++)
{
scanf("%d",&x);
if(best1+x>=x)best1 += x; else
{
best1 = x;
p1 = i;
}
if(best1>best)
{
best = best1;
p = p1;
u = i;
}
}
printf("%d %d %d\n",best,p,u);
return 0;
}