Cod sursa(job #2427218)
| Utilizator | Data | 31 mai 2019 10:29:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define N 1003
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 i, j;
int nr=0, m=1, s[N], poz[N], x=1;
int main()
{
cit();
int sum=0;
for(i=1; i<=n; ++i)
{
sum+=a[i];
if(sum<a[i]){
sum=s[i]=a[i];
x=i;
poz[i]=i;
}
else poz[i]=x,s[i]=sum;
}
int j=1;
for(i=1; i<=n; ++i)
if(s[i]>s[j]) j=i;
while(1)
fout<<s[j]<<" "<<poz[j]<<" "<<j;
return 0;
}
