Cod sursa(job #971914)
Utilizator | Data | 10 iulie 2013 15:24:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,s=0,smax=-((1<<31)-1),smin=0,smni=0,sxi,sxj;
f>>n;
for(int i=1;i<=n;i++){
int x;
f>>x;
s+=x;
if(s-smin>smax){
smax=s-smin;
sxi=smni+1;
sxj=i;
}
if(s<smin){
smin=s;
smni=i;
}
}
g<<smax<<" "<<sxi<<" "<<sxj;
return 0;
}