codeforces 148 div2 B

http://codeforces.com/contest/239/problem/B

蛋疼的模拟题 并不难 直接模拟就行 郁闷 codeforces上的题目总是看的蛋疼 老是看不懂

要么搞错题意 比赛时候看题就浪费快半个小时 而且好像还忽略了某个条件

代码贴着做教训

代码：

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
using namespace std;
char word[105];
char words[105];
int hashs[15];
int main()
{
    int n,q;
    scanf("%d%d",&n,&q);
    scanf("%s",word+1);
    while(q--)
    {
        memset(hashs,0,sizeof(hashs));
        int l,r;
        strcpy(words+1,word+1);
        scanf("%d%d",&l,&r);
        int point=l;
        int dir=1;
        int sign;
        while(point>=l&&point<=r)
        {
            sign=point-dir;
            if(words[point]<'0')
            {
                while(words[point]<'0'&&point<=r&&point>=l)
                point+=dir;
                if(point<l||point>r)
                break;
            }
            if(words[sign]=='>'&&words[point]=='<')
            words[sign]='0'-1;
            if(words[sign]=='<'&&words[point]=='>')
            words[sign]='0'-1;
            if(words[sign]=='>'&&words[point]=='>')
            words[sign]='0'-1;
            if(words[sign]=='<'&&words[point]=='<')
            words[sign]='0'-1;
            if(words[point]>='0'&&words[point]<='9')
            hashs[words[point]-'0']++,words[point]--;
            else if(words[point]=='>')
            dir=1;
            else if(words[point]=='<')
            dir=-1;
            point+=dir;
        }
        for(int i=0;i<=9;i++)
        if(i==9)
        printf("%d\n",hashs[i]);
        else
        printf("%d ",hashs[i]);
    }
}