Cod sursa(job #1433089)
| Utilizator | Data | 9 mai 2015 14:54:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int v[6000000];
int main()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,i,s=0,a,b,c,x,smax=-1000;
f>>n;
a=1;
b=1;
for(i=1; i<=n; i++){
f>>x;
if(s<0&&x>0){
s=x;
a=i;
}
else{
s+=x;
b=i;
}
if(s>smax){
smax=s;
c=i;
}
}
if(smax>s){
g<<smax<<' '<<a<<' '<<c;
}
else if(smax<s)
g<<s<<' '<<a<<' '<<b;
return 0;
}
