Cod sursa(job #2221988)
Utilizator | Data | 16 iulie 2018 11:57:10 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
void update(int cod, int st, int dr)
{
if( gx <= st && gy <= dr )
{
a[]
return;
}
}
int main()
{
f >> n >> m;
for ( int i = 1 ; i <= n ; i ++ )
f >> a[i];
for ( int i = 1 ; i <= n ; i ++ )
{
gx = gy = i;
val=a[i];
update(1, 1, n);
}
return 0;
}