Cod sursa(job #1829721)
Utilizator | Data | 15 decembrie 2016 16:17:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <climits>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n;
int mi=1, mj, j, s=0, k, maxxJ=0, maxxI=0;
int m=INT_MIN;
f>>n;
for(int i=1; i<=n; i++)
{
f>>k;
s=s+k;
if(s>m)
{
m=s;
maxxJ=i;
maxxI=mi;
}
if(s<0)
{
s=0;
mi=i+1;
}
}
g<<m<<" "<<maxxI<<" "<<maxxJ;
return 0;
}