Cod sursa(job #1091728)
| Utilizator | Data | 25 ianuarie 2014 22:55:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std ;
const int NMAX = 6000005 ;
const int INFINIT = 0x3f3f3f3f ;
ifstream cin("ssm.in") ;
ofstream cout("ssm.out") ;
int N, S, dx, first, last, bestSum, sum;
int main()
{
cin >> N ;
for(int i = 1 ; i <= N ; ++ i)
{
cin >> S ;
if(sum < 0)
sum = S, dx = i ;
else sum = sum + S ;
if(bestSum < sum )
bestSum = sum, first = dx ,last = i ;
}
cout << bestSum << ' ' << first <<' '<< last;
cin.close();
cout.close();
return 0 ;
}
