Cod sursa(job #1131629)
Utilizator | Meriniuc Razvan- Dumitru meriniucr | Data | 28 februarie 2014 22:33:31 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define maxm 6000010
using namespace std;
int r[maxm];
int main()
{
ifstream mama("ssm.in");
ofstream tata("ssm.out");
int n,a[maxm],x[maxm],i,ma,mi,e,f;
mama>>n;
r[0]=0; a[0]=0;
for(i=1;i<=n;i++)
{
mama>>x[i];
a[i]=a[i-1]+x[i];
}
mi=0; ma= -1000000;
for(i=1;i<=n;i++)
{
r[i]=a[i]-mi;
if(mi>a[i]) {mi=a[i];e=i;}
if(r[i]>ma) {ma=r[i];f=i;}
}
tata<<ma<<" "<<e+1<<" "<<f;
return 0;
}