Cod sursa(job #2387748)
| Utilizator | Data | 25 martie 2019 10:35:32 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
vector <int> v;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int64_t n,x,i;
fin>>n;
for (i=0;i<n;i++) {
fin>>x;
v.push_back(x);
}
int64_t k,sum,a,kk,aa=0,ce,da;
for (i=0;i<v.size();i++) {
sum=0;
a=0;
for (k=i;k<v.size();k++) {
sum+=v[k];
if(sum>a) {
a=sum;
kk=k;
}
if (a>aa) {
aa=a;
ce=i;
da=k;
}
}
}
fout<<aa<<" "<<ce+1<<" "<<da+1;
fin.close();
fout.close();
}
