Cod sursa(job #2335493)
| Utilizator | Data | 4 februarie 2019 10:43:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000004],a,s[6000004],maxx,b,c;
int main()
{
fin>>n;
for (int i=1;i<=n;i++){
fin>>v[i];
s[i]=s[i-1]+v[i];
}
for (int i=1;i<n;i++){
for (int j=i+1;j<=n;j++){
a=s[j]-s[i-1];
if(a>maxx){
maxx=a;
b=i;
c=j;}
}
}
fout<<maxx<<" "<<b<<" "<<c;
fin.close();
fout.close();
return 0;
}
