Cod sursa(job #556156)
| Utilizator | Data | 15 martie 2011 23:18:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f; ofstream g;
int sum,i,n,nr,s,pi,ps,minim=numeric_limits<int>::max(),maxim=numeric_limits<int>::min();
int main(){
f.open("ssm.in"); g.open("ssm.out");
f>>n; f>>s;
for(i=2;i<=n;++i){
f>>nr;
if(minim>s) minim=s,pi=i;
s+=nr; sum=s-minim;
if(sum>maxim) maxim=sum,ps=i;
}
if(pi>ps) pi=ps;
g<<maxim<<' '<<pi<<' '<<ps;
return 0;
}
