Holes CF 13E

分块+递推

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string>    
#include <sstream>
#include <utility>   
#include <ctime>
#include <bitset>
//#pragma comment(linker, "/STACK:102400000,102400000")

using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::stringstream;
using std::make_pair;
using std::getline;
using std::greater;
using std::endl;
using std::multimap;
using std::deque;
using std::unique;
using std::lower_bound;
using std::random_shuffle;
using std::bitset;
using std::upper_bound;
using std::multiset;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned UN;
typedef pair<int, int> PAIR;
typedef multimap<int, int> MMAP;
typedef LL TY;
typedef long double LF;

const int MAXN(1500010);
const int MAXM(50010);
const int MAXE(150010);
const int MAXK(6);
const int HSIZE(1313);
const int SIGMA_SIZE(4);
const int MAXH(20);
const int INFI((INT_MAX-1) >> 1);
const ULL BASE(31);
const LL LIM(1e13);
const int INV(-10000);
const int MOD(31313);
const double EPS(1e-7);
const LF PI(acos(-1.0));

template<typename T> inline void checkmax(T &a, T b){if(b > a) a = b;}
template<typename T> inline void checkmin(T &a, T b){if(b < a) a = b;}
template<typename T> inline T ABS(const T &a){return a < 0? -a: a;}

int arr[100010], next[100010], block[100010], rec[100010][2];

int main()  
{
	int n, m;
	while(~scanf("%d%d", &n, &m))
	{
		for(int i = 0; i < n; ++i) scanf("%d", arr+i);
		int tn = sqrt((double) n)+0.5, bc = 0;
		for(int i = 0; i < n; i += tn)
		{
			for(int ti = i, j = 0; ti < n && j < tn; ++ti, ++j) block[ti] = bc;
			++bc;
		}
		for(int i = n-1; i >= 0; --i)
		{
			int ti = i+arr[i];
			if(ti >= n || block[i] != block[ti])
			{
				rec[i][0] = i;
				rec[i][1] = 1;
				next[i] = ti;
			}
			else
			{
				rec[i][0] = rec[ti][0];
				rec[i][1] = rec[ti][1]+1;
				next[i] = next[ti];
			}
		}
		int f, a, b;
		for(int i = 0; i < m; ++i)
		{
			scanf("%d", &f);
			if(f)
			{
				scanf("%d", &a);
				--a;
				int ans = rec[a][1];
				while(next[a]  < n)
				{
					a = next[a];
					ans += rec[a][1];
				}
				printf("%d %d\n", rec[a][0]+1, ans);
			}
			else
			{
				scanf("%d%d", &a, &b);
				arr[--a] = b;
				int e = block[a]*tn;
				for(int j = a; j >= e; --j)
				{
					int tj = j+arr[j];
					if(tj >= n || block[j] != block[tj])
					{
						rec[j][0] = j;
						rec[j][1] = 1;
						next[j] = tj;
					}
					else
					{
						rec[j][0] = rec[tj][0];
						rec[j][1] = rec[tj][1]+1;
						next[j] = next[tj];
					}
				}
			}
		}
	}
	return 0;	
}