Cod sursa(job #2262041)
| Utilizator | Data | 16 octombrie 2018 21:52:35 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[10000];
int main()
{
int a,b,sum=0,i,n,maxx=-99999;
cin >> n;
a=1;
for (i=1;i<=n;i++) {
cin >> s[i];
sum = sum+s[i];
if (sum<0) {
sum = 0;
a=i+1;
b=0;
}
if (sum>maxx) {
maxx = sum;
b=i;
}
}
cout << maxx <<" "<< a<< " "<<b;
fin.close();
fout.close();
return 0;
}
