Cod sursa(job #1322979)
Utilizator | Data | 20 ianuarie 2015 16:18:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.24 kb |
#include<fstream>
using namespace std;
int s[6000000],l,Max,pmax,umax,pc,uc
ifstream f("cmm.in");
ofstream g("cmm.out");
int main(){
f>>l;
Max=s[1];
pmax=1;
umax=1;
Max=0;
for(i=2;i<=l;i++){
f>>
pmax
}
return 0;
}