Cod sursa(job #2427254)
| Utilizator | Data | 31 mai 2019 12:42:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
#define N 6000001
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
int n, a[N];
void cit(){
int i;
fin>>n;
for(i=1; i<=n; ++i)
fin>>a[i];
}
int nr=0, m=1, poz[N], x=1;
int s[N], sum=0;
int main()
{
int i=1, j=1;
cit();
for(i=1; i<=n; ++i)
{
sum=sum+a[i];
if(sum<a[i])
{
sum=s[i]=a[i];
poz[i]=x=i;
}
else
{
poz[i]=x;
s[i]=sum;
}
}
j=1;
for(i=1; i<=n; ++i)
if(s[i]>s[j]) j=i;
fout<<s[j]<<" "<<poz[j]<<" "<<j;
return 0;
}
