Pagini recente » Cod sursa (job #1043263) | Cod sursa (job #1283385) | Cod sursa (job #167963) | Cod sursa (job #1910006) | Cod sursa (job #1425964)
#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <stack>
#include <bitset>
#define MAX 250001
using namespace std;
vector < int> stiva;
stack <int > vecini [ MAX ] ;
vector < int > q_a [ MAX] ;
//bitset <1> viz[ 250002 ];
int main()
{
int n,m,p,q,i = 1;
// citesc cererile
/*
for(i = 0;i <= n ; i++){
cout<<i<<" : ";
for(int j = 0; j <cereri[i].size(); j++)
cout<<cereri[i][j]<<" ";
cout<<endl;
}
*/
return 0;
}